15.45/11.37 YES 15.45/11.37 15.45/11.37 Ultimate: Cannot open display: 15.45/11.37 This is Ultimate 0.1.24-8dc7c08-m 15.45/11.37 [2019-03-28 12:04:18,853 INFO L170 SettingsManager]: Resetting all preferences to default values... 15.45/11.37 [2019-03-28 12:04:18,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 15.45/11.37 [2019-03-28 12:04:18,867 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 15.45/11.37 [2019-03-28 12:04:18,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 15.45/11.37 [2019-03-28 12:04:18,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 15.45/11.37 [2019-03-28 12:04:18,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 15.45/11.37 [2019-03-28 12:04:18,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 15.45/11.37 [2019-03-28 12:04:18,873 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 15.45/11.38 [2019-03-28 12:04:18,874 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 15.45/11.38 [2019-03-28 12:04:18,874 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 15.45/11.38 [2019-03-28 12:04:18,875 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 15.45/11.38 [2019-03-28 12:04:18,876 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 15.45/11.38 [2019-03-28 12:04:18,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 15.45/11.38 [2019-03-28 12:04:18,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 15.45/11.38 [2019-03-28 12:04:18,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 15.45/11.38 [2019-03-28 12:04:18,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 15.45/11.38 [2019-03-28 12:04:18,881 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 15.45/11.38 [2019-03-28 12:04:18,883 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 15.45/11.38 [2019-03-28 12:04:18,884 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 15.45/11.38 [2019-03-28 12:04:18,885 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 15.45/11.38 [2019-03-28 12:04:18,886 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 15.45/11.38 [2019-03-28 12:04:18,888 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 15.45/11.38 [2019-03-28 12:04:18,888 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 15.45/11.38 [2019-03-28 12:04:18,889 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 15.45/11.38 [2019-03-28 12:04:18,889 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 15.45/11.38 [2019-03-28 12:04:18,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 15.45/11.38 [2019-03-28 12:04:18,891 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 15.45/11.38 [2019-03-28 12:04:18,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 15.45/11.38 [2019-03-28 12:04:18,892 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 15.45/11.38 [2019-03-28 12:04:18,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 15.45/11.38 [2019-03-28 12:04:18,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 15.45/11.38 [2019-03-28 12:04:18,894 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 15.45/11.38 [2019-03-28 12:04:18,894 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 15.45/11.38 [2019-03-28 12:04:18,895 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 15.45/11.38 [2019-03-28 12:04:18,895 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 15.45/11.38 [2019-03-28 12:04:18,895 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 15.45/11.38 [2019-03-28 12:04:18,896 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 15.45/11.38 [2019-03-28 12:04:18,897 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 15.45/11.38 [2019-03-28 12:04:18,897 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 15.45/11.38 [2019-03-28 12:04:18,911 INFO L110 SettingsManager]: Loading preferences was successful 15.45/11.38 [2019-03-28 12:04:18,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 15.45/11.38 [2019-03-28 12:04:18,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 15.45/11.38 [2019-03-28 12:04:18,913 INFO L133 SettingsManager]: * Rewrite not-equals=true 15.45/11.38 [2019-03-28 12:04:18,930 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 15.45/11.38 [2019-03-28 12:04:18,930 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 15.45/11.38 [2019-03-28 12:04:18,930 INFO L133 SettingsManager]: * Use SBE=true 15.45/11.38 [2019-03-28 12:04:18,931 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 15.45/11.38 [2019-03-28 12:04:18,931 INFO L133 SettingsManager]: * Use old map elimination=false 15.45/11.38 [2019-03-28 12:04:18,931 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 15.45/11.38 [2019-03-28 12:04:18,931 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 15.45/11.38 [2019-03-28 12:04:18,931 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 15.45/11.38 [2019-03-28 12:04:18,932 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 15.45/11.38 [2019-03-28 12:04:18,932 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 15.45/11.38 [2019-03-28 12:04:18,932 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:18,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 15.45/11.38 [2019-03-28 12:04:18,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 15.45/11.38 [2019-03-28 12:04:18,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE 15.45/11.38 [2019-03-28 12:04:18,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 15.45/11.38 [2019-03-28 12:04:18,933 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 15.45/11.38 [2019-03-28 12:04:18,933 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 15.45/11.38 [2019-03-28 12:04:18,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 15.45/11.38 [2019-03-28 12:04:18,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 15.45/11.38 [2019-03-28 12:04:18,933 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 15.45/11.38 [2019-03-28 12:04:18,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 15.45/11.38 [2019-03-28 12:04:18,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 15.45/11.38 [2019-03-28 12:04:18,934 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 15.45/11.38 [2019-03-28 12:04:18,934 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 15.45/11.38 [2019-03-28 12:04:18,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 15.45/11.38 [2019-03-28 12:04:18,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 15.45/11.38 [2019-03-28 12:04:19,040 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 15.45/11.38 [2019-03-28 12:04:19,044 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 15.45/11.38 [2019-03-28 12:04:19,045 INFO L271 PluginConnector]: Initializing CDTParser... 15.45/11.38 [2019-03-28 12:04:19,046 INFO L276 PluginConnector]: CDTParser initialized 15.45/11.38 [2019-03-28 12:04:19,046 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 15.45/11.38 [2019-03-28 12:04:20,396 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/c3ad605b464044b89f53cec831163936/FLAG20b017952 15.45/11.38 [2019-03-28 12:04:21,006 INFO L307 CDTParser]: Found 1 translation units. 15.45/11.38 [2019-03-28 12:04:21,007 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 15.45/11.38 [2019-03-28 12:04:21,014 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/c3ad605b464044b89f53cec831163936/FLAG20b017952 15.45/11.38 [2019-03-28 12:04:21,423 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/c3ad605b464044b89f53cec831163936 15.45/11.38 [2019-03-28 12:04:21,434 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 15.45/11.38 [2019-03-28 12:04:21,436 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 15.45/11.38 [2019-03-28 12:04:21,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 15.45/11.38 [2019-03-28 12:04:21,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 15.45/11.38 [2019-03-28 12:04:21,441 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 15.45/11.38 [2019-03-28 12:04:21,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a0b462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21, skipping insertion in model container 15.45/11.38 [2019-03-28 12:04:21,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 15.45/11.38 [2019-03-28 12:04:21,501 INFO L176 MainTranslator]: Built tables and reachable declarations 15.45/11.38 [2019-03-28 12:04:21,662 INFO L206 PostProcessor]: Analyzing one entry point: main 15.45/11.38 [2019-03-28 12:04:21,666 INFO L191 MainTranslator]: Completed pre-run 15.45/11.38 [2019-03-28 12:04:21,683 INFO L206 PostProcessor]: Analyzing one entry point: main 15.45/11.38 [2019-03-28 12:04:21,698 INFO L195 MainTranslator]: Completed translation 15.45/11.38 [2019-03-28 12:04:21,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21 WrapperNode 15.45/11.38 [2019-03-28 12:04:21,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 15.45/11.38 [2019-03-28 12:04:21,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 15.45/11.38 [2019-03-28 12:04:21,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 15.45/11.38 [2019-03-28 12:04:21,700 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 15.45/11.38 [2019-03-28 12:04:21,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 15.45/11.38 [2019-03-28 12:04:21,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 15.45/11.38 [2019-03-28 12:04:21,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 15.45/11.38 [2019-03-28 12:04:21,804 INFO L276 PluginConnector]: Boogie Preprocessor initialized 15.45/11.38 [2019-03-28 12:04:21,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 [2019-03-28 12:04:21,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 15.45/11.38 [2019-03-28 12:04:21,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 15.45/11.38 [2019-03-28 12:04:21,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... 15.45/11.38 [2019-03-28 12:04:21,845 INFO L276 PluginConnector]: RCFGBuilder initialized 15.45/11.38 [2019-03-28 12:04:21,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (1/1) ... 15.45/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.45/11.38 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 15.45/11.38 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 15.45/11.38 [2019-03-28 12:04:21,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 15.45/11.38 [2019-03-28 12:04:21,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 15.45/11.38 [2019-03-28 12:04:22,074 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 15.45/11.38 [2019-03-28 12:04:22,074 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 15.45/11.38 [2019-03-28 12:04:22,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:22 BoogieIcfgContainer 15.45/11.38 [2019-03-28 12:04:22,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 15.45/11.38 [2019-03-28 12:04:22,076 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 15.45/11.38 [2019-03-28 12:04:22,076 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 15.45/11.38 [2019-03-28 12:04:22,078 INFO L276 PluginConnector]: BlockEncodingV2 initialized 15.45/11.38 [2019-03-28 12:04:22,079 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:22" (1/1) ... 15.45/11.38 [2019-03-28 12:04:22,094 INFO L313 BlockEncoder]: Initial Icfg 12 locations, 17 edges 15.45/11.38 [2019-03-28 12:04:22,097 INFO L258 BlockEncoder]: Using Remove infeasible edges 15.45/11.38 [2019-03-28 12:04:22,097 INFO L263 BlockEncoder]: Using Maximize final states 15.45/11.38 [2019-03-28 12:04:22,098 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 15.45/11.38 [2019-03-28 12:04:22,098 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 15.45/11.38 [2019-03-28 12:04:22,100 INFO L296 BlockEncoder]: Using Remove sink states 15.45/11.38 [2019-03-28 12:04:22,101 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 15.45/11.38 [2019-03-28 12:04:22,101 INFO L179 BlockEncoder]: Using Rewrite not-equals 15.45/11.38 [2019-03-28 12:04:22,120 INFO L185 BlockEncoder]: Using Use SBE 15.45/11.38 [2019-03-28 12:04:22,149 INFO L200 BlockEncoder]: SBE split 4 edges 15.45/11.38 [2019-03-28 12:04:22,154 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 15.45/11.38 [2019-03-28 12:04:22,156 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.45/11.38 [2019-03-28 12:04:22,171 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 15.45/11.38 [2019-03-28 12:04:22,173 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 15.45/11.38 [2019-03-28 12:04:22,174 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 15.45/11.38 [2019-03-28 12:04:22,175 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.45/11.38 [2019-03-28 12:04:22,175 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 15.45/11.38 [2019-03-28 12:04:22,175 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 15.45/11.38 [2019-03-28 12:04:22,176 INFO L313 BlockEncoder]: Encoded RCFG 7 locations, 44 edges 15.45/11.38 [2019-03-28 12:04:22,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:04:22 BasicIcfg 15.45/11.38 [2019-03-28 12:04:22,176 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 15.45/11.38 [2019-03-28 12:04:22,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 15.45/11.38 [2019-03-28 12:04:22,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... 15.45/11.38 [2019-03-28 12:04:22,180 INFO L276 PluginConnector]: TraceAbstraction initialized 15.45/11.38 [2019-03-28 12:04:22,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:04:21" (1/4) ... 15.45/11.38 [2019-03-28 12:04:22,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7836e539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:04:22, skipping insertion in model container 15.45/11.38 [2019-03-28 12:04:22,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (2/4) ... 15.45/11.38 [2019-03-28 12:04:22,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7836e539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:04:22, skipping insertion in model container 15.45/11.38 [2019-03-28 12:04:22,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:22" (3/4) ... 15.45/11.38 [2019-03-28 12:04:22,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7836e539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:04:22, skipping insertion in model container 15.45/11.38 [2019-03-28 12:04:22,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:04:22" (4/4) ... 15.45/11.38 [2019-03-28 12:04:22,184 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 15.45/11.38 [2019-03-28 12:04:22,194 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 15.45/11.38 [2019-03-28 12:04:22,203 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 15.45/11.38 [2019-03-28 12:04:22,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 15.45/11.38 [2019-03-28 12:04:22,248 INFO L133 ementStrategyFactory]: Using default assertion order modulation 15.45/11.38 [2019-03-28 12:04:22,249 INFO L382 AbstractCegarLoop]: Interprodecural is true 15.45/11.38 [2019-03-28 12:04:22,249 INFO L383 AbstractCegarLoop]: Hoare is true 15.45/11.38 [2019-03-28 12:04:22,250 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 15.45/11.38 [2019-03-28 12:04:22,250 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 15.45/11.38 [2019-03-28 12:04:22,250 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 15.45/11.38 [2019-03-28 12:04:22,250 INFO L387 AbstractCegarLoop]: Difference is false 15.45/11.38 [2019-03-28 12:04:22,250 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 15.45/11.38 [2019-03-28 12:04:22,250 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 15.45/11.38 [2019-03-28 12:04:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. 15.45/11.38 [2019-03-28 12:04:22,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 15.45/11.38 [2019-03-28 12:04:22,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. 15.45/11.38 [2019-03-28 12:04:22,328 INFO L451 ceAbstractionStarter]: At program point L16(lines 13 19) the Hoare annotation is: true 15.45/11.38 [2019-03-28 12:04:22,328 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. 15.45/11.38 [2019-03-28 12:04:22,328 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 15.45/11.38 [2019-03-28 12:04:22,328 INFO L451 ceAbstractionStarter]: At program point L13(lines 4 21) the Hoare annotation is: true 15.45/11.38 [2019-03-28 12:04:22,328 INFO L451 ceAbstractionStarter]: At program point L9(lines 6 12) the Hoare annotation is: true 15.45/11.38 [2019-03-28 12:04:22,329 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 10) no Hoare annotation was computed. 15.45/11.38 [2019-03-28 12:04:22,329 INFO L451 ceAbstractionStarter]: At program point L18(lines 4 21) the Hoare annotation is: true 15.45/11.38 [2019-03-28 12:04:22,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:04:22 BasicIcfg 15.45/11.38 [2019-03-28 12:04:22,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 15.45/11.38 [2019-03-28 12:04:22,338 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 15.45/11.38 [2019-03-28 12:04:22,338 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 15.45/11.38 [2019-03-28 12:04:22,341 INFO L276 PluginConnector]: BuchiAutomizer initialized 15.45/11.38 [2019-03-28 12:04:22,342 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.45/11.38 [2019-03-28 12:04:22,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:04:21" (1/5) ... 15.45/11.38 [2019-03-28 12:04:22,343 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d5c8c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:04:22, skipping insertion in model container 15.45/11.38 [2019-03-28 12:04:22,343 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.45/11.38 [2019-03-28 12:04:22,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:04:21" (2/5) ... 15.45/11.38 [2019-03-28 12:04:22,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d5c8c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:04:22, skipping insertion in model container 15.45/11.38 [2019-03-28 12:04:22,344 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.45/11.38 [2019-03-28 12:04:22,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:04:22" (3/5) ... 15.45/11.38 [2019-03-28 12:04:22,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d5c8c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:04:22, skipping insertion in model container 15.45/11.38 [2019-03-28 12:04:22,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.45/11.38 [2019-03-28 12:04:22,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:04:22" (4/5) ... 15.45/11.38 [2019-03-28 12:04:22,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d5c8c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:04:22, skipping insertion in model container 15.45/11.38 [2019-03-28 12:04:22,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.45/11.38 [2019-03-28 12:04:22,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:04:22" (5/5) ... 15.45/11.38 [2019-03-28 12:04:22,347 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 15.45/11.38 [2019-03-28 12:04:22,375 INFO L133 ementStrategyFactory]: Using default assertion order modulation 15.45/11.38 [2019-03-28 12:04:22,376 INFO L374 BuchiCegarLoop]: Interprodecural is true 15.45/11.38 [2019-03-28 12:04:22,376 INFO L375 BuchiCegarLoop]: Hoare is true 15.45/11.38 [2019-03-28 12:04:22,376 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 15.45/11.38 [2019-03-28 12:04:22,376 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 15.45/11.38 [2019-03-28 12:04:22,376 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 15.45/11.38 [2019-03-28 12:04:22,376 INFO L379 BuchiCegarLoop]: Difference is false 15.45/11.38 [2019-03-28 12:04:22,376 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 15.45/11.38 [2019-03-28 12:04:22,377 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 15.45/11.38 [2019-03-28 12:04:22,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. 15.45/11.38 [2019-03-28 12:04:22,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 15.45/11.38 [2019-03-28 12:04:22,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.45/11.38 [2019-03-28 12:04:22,400 INFO L119 BuchiIsEmpty]: Starting construction of run 15.45/11.38 [2019-03-28 12:04:22,407 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 15.45/11.38 [2019-03-28 12:04:22,407 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 15.45/11.38 [2019-03-28 12:04:22,408 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 15.45/11.38 [2019-03-28 12:04:22,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. 15.45/11.38 [2019-03-28 12:04:22,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 15.45/11.38 [2019-03-28 12:04:22,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.45/11.38 [2019-03-28 12:04:22,410 INFO L119 BuchiIsEmpty]: Starting construction of run 15.45/11.38 [2019-03-28 12:04:22,410 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 15.45/11.38 [2019-03-28 12:04:22,410 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 15.45/11.38 [2019-03-28 12:04:22,415 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [43] ULTIMATE.startENTRY-->L18: Formula: (and (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (= v_ULTIMATE.start_f_~i~0_1 0) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet2_1|) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet3_1|) (= v_ULTIMATE.start_f_~j~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_1, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_~j~0=v_ULTIMATE.start_f_~j~0_1, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~post0=|v_ULTIMATE.start_f_#t~post0_1|, ULTIMATE.start_f_#t~post1=|v_ULTIMATE.start_f_#t~post1_1|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_~i~0, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_~j~0, ULTIMATE.start_f_~k, ULTIMATE.start_main_#res, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~post0, ULTIMATE.start_f_#t~post1, ULTIMATE.start_main_#t~ret4] 6#L18true 15.45/11.38 [2019-03-28 12:04:22,416 INFO L796 eck$LassoCheckResult]: Loop: 6#L18true [47] L18-->L9: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9#L9true [58] L9-->L13: Formula: (>= v_ULTIMATE.start_f_~i~0_4 v_ULTIMATE.start_f_~k_3) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_4} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_4} AuxVars[] AssignedVars[] 7#L13true [49] L13-->L16: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5#L16true [45] L16-->L15: Formula: (and (= (+ v_ULTIMATE.start_f_~j~0_6 1) v_ULTIMATE.start_f_~j~0_5) (< v_ULTIMATE.start_f_~j~0_6 v_ULTIMATE.start_f_~l_4)) InVars {ULTIMATE.start_f_~j~0=v_ULTIMATE.start_f_~j~0_6, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_4} OutVars{ULTIMATE.start_f_~j~0=v_ULTIMATE.start_f_~j~0_5, ULTIMATE.start_f_#t~post1=|v_ULTIMATE.start_f_#t~post1_2|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_4} AuxVars[] AssignedVars[ULTIMATE.start_f_~j~0, ULTIMATE.start_f_#t~post1] 3#L15true [99] L15-->L18: Formula: (let ((.cse0 (mod v_ULTIMATE.start_f_~i~0_10 2))) (and (= (+ .cse0 (- 2)) 0) (> .cse0 0) (< v_ULTIMATE.start_f_~i~0_10 0))) InVars {ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_10} OutVars{ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_10} AuxVars[] AssignedVars[] 6#L18true 15.45/11.38 [2019-03-28 12:04:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash 74, now seen corresponding path program 1 times 15.45/11.38 [2019-03-28 12:04:22,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.45/11.38 [2019-03-28 12:04:22,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.45/11.38 [2019-03-28 12:04:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:22,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:22,522 INFO L82 PathProgramCache]: Analyzing trace with hash 73811099, now seen corresponding path program 1 times 15.45/11.38 [2019-03-28 12:04:22,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.45/11.38 [2019-03-28 12:04:22,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.45/11.38 [2019-03-28 12:04:22,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.45/11.38 [2019-03-28 12:04:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.45/11.38 [2019-03-28 12:04:22,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 15.45/11.38 [2019-03-28 12:04:22,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 15.45/11.38 [2019-03-28 12:04:22,572 INFO L811 eck$LassoCheckResult]: loop already infeasible 15.45/11.38 [2019-03-28 12:04:22,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. 15.45/11.38 [2019-03-28 12:04:22,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 15.45/11.38 [2019-03-28 12:04:22,589 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 2 states. 15.45/11.38 [2019-03-28 12:04:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 15.45/11.38 [2019-03-28 12:04:22,676 INFO L93 Difference]: Finished difference Result 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 15.45/11.38 [2019-03-28 12:04:22,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 15.45/11.38 [2019-03-28 12:04:22,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 15.45/11.38 [2019-03-28 12:04:22,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 15.45/11.38 [2019-03-28 12:04:22,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 15.45/11.38 [2019-03-28 12:04:22,688 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. 15.45/11.38 [2019-03-28 12:04:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 15.45/11.38 [2019-03-28 12:04:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,718 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,718 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,718 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 15.45/11.38 [2019-03-28 12:04:22,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 14 transitions. 15.45/11.38 [2019-03-28 12:04:22,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 15.45/11.38 [2019-03-28 12:04:22,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.45/11.38 [2019-03-28 12:04:22,719 INFO L119 BuchiIsEmpty]: Starting construction of run 15.45/11.38 [2019-03-28 12:04:22,719 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 15.45/11.38 [2019-03-28 12:04:22,720 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 15.45/11.38 [2019-03-28 12:04:22,720 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRY [43] ULTIMATE.startENTRY-->L18: Formula: (and (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (= v_ULTIMATE.start_f_~i~0_1 0) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet2_1|) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet3_1|) (= v_ULTIMATE.start_f_~j~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_1, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_~j~0=v_ULTIMATE.start_f_~j~0_1, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~post0=|v_ULTIMATE.start_f_#t~post0_1|, ULTIMATE.start_f_#t~post1=|v_ULTIMATE.start_f_#t~post1_1|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_~i~0, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_~j~0, ULTIMATE.start_f_~k, ULTIMATE.start_main_#res, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~post0, ULTIMATE.start_f_#t~post1, ULTIMATE.start_main_#t~ret4] 24#L18 15.45/11.38 [2019-03-28 12:04:22,720 INFO L796 eck$LassoCheckResult]: Loop: 24#L18 [47] L18-->L9: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 26#L9 [58] L9-->L13: Formula: (>= v_ULTIMATE.start_f_~i~0_4 v_ULTIMATE.start_f_~k_3) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_4} OutVars{ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_3, ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_4} AuxVars[] AssignedVars[] 27#L13 [49] L13-->L16: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 23#L16 [45] L16-->L15: Formula: (and (= (+ v_ULTIMATE.start_f_~j~0_6 1) v_ULTIMATE.start_f_~j~0_5) (< v_ULTIMATE.start_f_~j~0_6 v_ULTIMATE.start_f_~l_4)) InVars {ULTIMATE.start_f_~j~0=v_ULTIMATE.start_f_~j~0_6, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_4} OutVars{ULTIMATE.start_f_~j~0=v_ULTIMATE.start_f_~j~0_5, ULTIMATE.start_f_#t~post1=|v_ULTIMATE.start_f_#t~post1_2|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_4} AuxVars[] AssignedVars[ULTIMATE.start_f_~j~0, ULTIMATE.start_f_#t~post1] 22#L15 [101] L15-->L18: Formula: (= (mod v_ULTIMATE.start_f_~i~0_10 2) 0) InVars {ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_10} OutVars{ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_10} AuxVars[] AssignedVars[] 24#L18 15.45/11.38 [2019-03-28 12:04:22,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash 74, now seen corresponding path program 2 times 15.45/11.38 [2019-03-28 12:04:22,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.45/11.38 [2019-03-28 12:04:22,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.45/11.38 [2019-03-28 12:04:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:22,729 INFO L82 PathProgramCache]: Analyzing trace with hash 73811101, now seen corresponding path program 1 times 15.45/11.38 [2019-03-28 12:04:22,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.45/11.38 [2019-03-28 12:04:22,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.45/11.38 [2019-03-28 12:04:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:22,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:22,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2131228172, now seen corresponding path program 1 times 15.45/11.38 [2019-03-28 12:04:22,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.45/11.38 [2019-03-28 12:04:22,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.45/11.38 [2019-03-28 12:04:22,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:22,792 INFO L216 LassoAnalysis]: Preferences: 15.45/11.38 [2019-03-28 12:04:22,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 15.45/11.38 [2019-03-28 12:04:22,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 15.45/11.38 [2019-03-28 12:04:22,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 15.45/11.38 [2019-03-28 12:04:22,793 INFO L127 ssoRankerPreferences]: Use exernal solver: true 15.45/11.38 [2019-03-28 12:04:22,794 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:22,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 15.45/11.38 [2019-03-28 12:04:22,794 INFO L130 ssoRankerPreferences]: Path of dumped script: 15.45/11.38 [2019-03-28 12:04:22,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 15.45/11.38 [2019-03-28 12:04:22,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 15.45/11.38 [2019-03-28 12:04:22,795 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 15.45/11.38 [2019-03-28 12:04:22,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:22,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:22,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:22,929 INFO L300 LassoAnalysis]: Preprocessing complete. 15.45/11.38 [2019-03-28 12:04:22,930 INFO L412 LassoAnalysis]: Checking for nontermination... 15.45/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.45/11.38 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 15.45/11.38 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:22,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 15.45/11.38 [2019-03-28 12:04:22,938 INFO L163 nArgumentSynthesizer]: Using integer mode. 15.45/11.38 [2019-03-28 12:04:22,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. 15.45/11.38 [2019-03-28 12:04:22,947 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~post1=0} Honda state: {ULTIMATE.start_f_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 15.45/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.45/11.38 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 15.45/11.38 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:22,976 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 15.45/11.38 [2019-03-28 12:04:22,976 INFO L163 nArgumentSynthesizer]: Using integer mode. 15.45/11.38 [2019-03-28 12:04:22,983 INFO L445 LassoAnalysis]: Proved nontermination for one component. 15.45/11.38 [2019-03-28 12:04:22,983 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k=1, ULTIMATE.start_f_~i~0=2} Honda state: {ULTIMATE.start_f_~k=1, ULTIMATE.start_f_~i~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] 15.45/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.45/11.38 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 15.45/11.38 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:23,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 15.45/11.38 [2019-03-28 12:04:23,011 INFO L163 nArgumentSynthesizer]: Using integer mode. 15.45/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.45/11.38 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 15.45/11.38 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:23,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 15.45/11.38 [2019-03-28 12:04:23,041 INFO L163 nArgumentSynthesizer]: Using integer mode. 15.45/11.38 [2019-03-28 12:04:23,218 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 15.45/11.38 [2019-03-28 12:04:23,221 INFO L216 LassoAnalysis]: Preferences: 15.45/11.38 [2019-03-28 12:04:23,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 15.45/11.38 [2019-03-28 12:04:23,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 15.45/11.38 [2019-03-28 12:04:23,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 15.45/11.38 [2019-03-28 12:04:23,221 INFO L127 ssoRankerPreferences]: Use exernal solver: false 15.45/11.38 [2019-03-28 12:04:23,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:23,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 15.45/11.38 [2019-03-28 12:04:23,222 INFO L130 ssoRankerPreferences]: Path of dumped script: 15.45/11.38 [2019-03-28 12:04:23,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 15.45/11.38 [2019-03-28 12:04:23,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 15.45/11.38 [2019-03-28 12:04:23,222 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 15.45/11.38 [2019-03-28 12:04:23,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:23,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:23,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:23,292 INFO L300 LassoAnalysis]: Preprocessing complete. 15.45/11.38 [2019-03-28 12:04:23,298 INFO L497 LassoAnalysis]: Using template 'affine'. 15.45/11.38 [2019-03-28 12:04:23,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.45/11.38 Termination analysis: LINEAR_WITH_GUESSES 15.45/11.38 Number of strict supporting invariants: 0 15.45/11.38 Number of non-strict supporting invariants: 1 15.45/11.38 Consider only non-deceasing supporting invariants: true 15.45/11.38 Simplify termination arguments: true 15.45/11.38 Simplify supporting invariants: trueOverapproximate stem: false 15.45/11.38 [2019-03-28 12:04:23,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.45/11.38 [2019-03-28 12:04:23,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.45/11.38 [2019-03-28 12:04:23,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.45/11.38 [2019-03-28 12:04:23,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.45/11.38 [2019-03-28 12:04:23,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.45/11.38 [2019-03-28 12:04:23,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.45/11.38 [2019-03-28 12:04:23,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.45/11.38 [2019-03-28 12:04:23,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.45/11.38 [2019-03-28 12:04:23,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.45/11.38 Termination analysis: LINEAR_WITH_GUESSES 15.45/11.38 Number of strict supporting invariants: 0 15.45/11.38 Number of non-strict supporting invariants: 1 15.45/11.38 Consider only non-deceasing supporting invariants: true 15.45/11.38 Simplify termination arguments: true 15.45/11.38 Simplify supporting invariants: trueOverapproximate stem: false 15.45/11.38 [2019-03-28 12:04:23,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.45/11.38 [2019-03-28 12:04:23,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.45/11.38 [2019-03-28 12:04:23,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.45/11.38 [2019-03-28 12:04:23,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.45/11.38 [2019-03-28 12:04:23,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.45/11.38 [2019-03-28 12:04:23,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.45/11.38 [2019-03-28 12:04:23,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.45/11.38 [2019-03-28 12:04:23,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.45/11.38 [2019-03-28 12:04:23,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.45/11.38 Termination analysis: LINEAR_WITH_GUESSES 15.45/11.38 Number of strict supporting invariants: 0 15.45/11.38 Number of non-strict supporting invariants: 1 15.45/11.38 Consider only non-deceasing supporting invariants: true 15.45/11.38 Simplify termination arguments: true 15.45/11.38 Simplify supporting invariants: trueOverapproximate stem: false 15.45/11.38 [2019-03-28 12:04:23,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.45/11.38 [2019-03-28 12:04:23,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.45/11.38 [2019-03-28 12:04:23,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.45/11.38 [2019-03-28 12:04:23,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.45/11.38 [2019-03-28 12:04:23,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.45/11.38 [2019-03-28 12:04:23,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.45/11.38 [2019-03-28 12:04:23,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.45/11.38 [2019-03-28 12:04:23,322 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 15.45/11.38 [2019-03-28 12:04:23,332 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 15.45/11.38 [2019-03-28 12:04:23,333 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 15.45/11.38 [2019-03-28 12:04:23,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 15.45/11.38 [2019-03-28 12:04:23,335 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 15.45/11.38 [2019-03-28 12:04:23,335 INFO L518 LassoAnalysis]: Proved termination. 15.45/11.38 [2019-03-28 12:04:23,336 INFO L520 LassoAnalysis]: Termination argument consisting of: 15.45/11.38 Ranking function f(ULTIMATE.start_f_~l, ULTIMATE.start_f_~j~0) = 1*ULTIMATE.start_f_~l - 1*ULTIMATE.start_f_~j~0 15.45/11.38 Supporting invariants [] 15.45/11.38 [2019-03-28 12:04:23,337 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 15.45/11.38 [2019-03-28 12:04:23,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.45/11.38 [2019-03-28 12:04:23,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core 15.45/11.38 [2019-03-28 12:04:23,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.45/11.38 [2019-03-28 12:04:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.45/11.38 [2019-03-28 12:04:23,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 15.45/11.38 [2019-03-28 12:04:23,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.45/11.38 [2019-03-28 12:04:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.45/11.38 [2019-03-28 12:04:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.45/11.38 [2019-03-28 12:04:23,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 15.45/11.38 [2019-03-28 12:04:23,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.45/11.38 [2019-03-28 12:04:23,459 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 15.45/11.38 [2019-03-28 12:04:23,462 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 15.45/11.38 [2019-03-28 12:04:23,463 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 14 transitions. cyclomatic complexity: 8 Second operand 4 states. 15.45/11.38 [2019-03-28 12:04:23,532 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 14 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 15 states and 30 transitions. Complement of second has 4 states. 15.45/11.38 [2019-03-28 12:04:23,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 15.45/11.38 [2019-03-28 12:04:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 15.45/11.38 [2019-03-28 12:04:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. 15.45/11.38 [2019-03-28 12:04:23,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 1 letters. Loop has 5 letters. 15.45/11.38 [2019-03-28 12:04:23,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.45/11.38 [2019-03-28 12:04:23,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 6 letters. Loop has 5 letters. 15.45/11.38 [2019-03-28 12:04:23,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.45/11.38 [2019-03-28 12:04:23,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 1 letters. Loop has 10 letters. 15.45/11.38 [2019-03-28 12:04:23,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.45/11.38 [2019-03-28 12:04:23,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 30 transitions. 15.45/11.38 [2019-03-28 12:04:23,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 15.45/11.38 [2019-03-28 12:04:23,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 23 transitions. 15.45/11.38 [2019-03-28 12:04:23,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 15.45/11.38 [2019-03-28 12:04:23,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 15.45/11.38 [2019-03-28 12:04:23,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 23 transitions. 15.45/11.38 [2019-03-28 12:04:23,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 15.45/11.38 [2019-03-28 12:04:23,547 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 23 transitions. 15.45/11.38 [2019-03-28 12:04:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 23 transitions. 15.45/11.38 [2019-03-28 12:04:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. 15.45/11.38 [2019-03-28 12:04:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 15.45/11.38 [2019-03-28 12:04:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. 15.45/11.38 [2019-03-28 12:04:23,550 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 22 transitions. 15.45/11.38 [2019-03-28 12:04:23,550 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 22 transitions. 15.45/11.38 [2019-03-28 12:04:23,550 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 15.45/11.38 [2019-03-28 12:04:23,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 22 transitions. 15.45/11.38 [2019-03-28 12:04:23,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 15.45/11.38 [2019-03-28 12:04:23,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.45/11.38 [2019-03-28 12:04:23,551 INFO L119 BuchiIsEmpty]: Starting construction of run 15.45/11.38 [2019-03-28 12:04:23,552 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 15.45/11.38 [2019-03-28 12:04:23,552 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 15.45/11.38 [2019-03-28 12:04:23,552 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY [43] ULTIMATE.startENTRY-->L18: Formula: (and (= v_ULTIMATE.start_f_~k_1 |v_ULTIMATE.start_f_#in~k_1|) (= v_ULTIMATE.start_f_~i~0_1 0) (= |v_ULTIMATE.start_f_#in~k_1| |v_ULTIMATE.start_main_#t~nondet2_1|) (= v_ULTIMATE.start_f_~l_1 |v_ULTIMATE.start_f_#in~l_1|) (= |v_ULTIMATE.start_f_#in~l_1| |v_ULTIMATE.start_main_#t~nondet3_1|) (= v_ULTIMATE.start_f_~j~0_1 0)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_f_#in~k=|v_ULTIMATE.start_f_#in~k_1|, ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_1, ULTIMATE.start_f_#in~l=|v_ULTIMATE.start_f_#in~l_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_~j~0=v_ULTIMATE.start_f_~j~0_1, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_f_~l=v_ULTIMATE.start_f_~l_1, ULTIMATE.start_f_#t~post0=|v_ULTIMATE.start_f_#t~post0_1|, ULTIMATE.start_f_#t~post1=|v_ULTIMATE.start_f_#t~post1_1|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_f_#in~k, ULTIMATE.start_f_~i~0, ULTIMATE.start_f_#in~l, ULTIMATE.start_f_#res, ULTIMATE.start_f_~j~0, ULTIMATE.start_f_~k, ULTIMATE.start_main_#res, ULTIMATE.start_f_~l, ULTIMATE.start_f_#t~post0, ULTIMATE.start_f_#t~post1, ULTIMATE.start_main_#t~ret4] 101#L18 [47] L18-->L9: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 102#L9 15.45/11.38 [2019-03-28 12:04:23,552 INFO L796 eck$LassoCheckResult]: Loop: 102#L9 [56] L9-->L8: Formula: (and (< v_ULTIMATE.start_f_~i~0_6 v_ULTIMATE.start_f_~k_4) (= v_ULTIMATE.start_f_~i~0_5 (+ v_ULTIMATE.start_f_~i~0_6 1))) InVars {ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_4, ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_6} OutVars{ULTIMATE.start_f_#t~post0=|v_ULTIMATE.start_f_#t~post0_2|, ULTIMATE.start_f_~k=v_ULTIMATE.start_f_~k_4, ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post0, ULTIMATE.start_f_~i~0] 105#L8 [66] L8-->L9: Formula: (let ((.cse0 (mod v_ULTIMATE.start_f_~i~0_7 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0))) InVars {ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_7} OutVars{ULTIMATE.start_f_~i~0=v_ULTIMATE.start_f_~i~0_7} AuxVars[] AssignedVars[] 102#L9 15.45/11.38 [2019-03-28 12:04:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2341, now seen corresponding path program 1 times 15.45/11.38 [2019-03-28 12:04:23,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.45/11.38 [2019-03-28 12:04:23,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.45/11.38 [2019-03-28 12:04:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:23,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2763, now seen corresponding path program 1 times 15.45/11.38 [2019-03-28 12:04:23,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.45/11.38 [2019-03-28 12:04:23,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.45/11.38 [2019-03-28 12:04:23,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:23,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:23,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:23,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2251503, now seen corresponding path program 1 times 15.45/11.38 [2019-03-28 12:04:23,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.45/11.38 [2019-03-28 12:04:23,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.45/11.38 [2019-03-28 12:04:23,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:23,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:23,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.45/11.38 [2019-03-28 12:04:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.45/11.38 [2019-03-28 12:04:23,615 INFO L216 LassoAnalysis]: Preferences: 15.45/11.38 [2019-03-28 12:04:23,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 15.45/11.38 [2019-03-28 12:04:23,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 15.45/11.38 [2019-03-28 12:04:23,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 15.45/11.38 [2019-03-28 12:04:23,615 INFO L127 ssoRankerPreferences]: Use exernal solver: true 15.45/11.38 [2019-03-28 12:04:23,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:23,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 15.45/11.38 [2019-03-28 12:04:23,616 INFO L130 ssoRankerPreferences]: Path of dumped script: 15.45/11.38 [2019-03-28 12:04:23,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 15.45/11.38 [2019-03-28 12:04:23,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 15.45/11.38 [2019-03-28 12:04:23,616 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 15.45/11.38 [2019-03-28 12:04:23,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:23,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:23,684 INFO L300 LassoAnalysis]: Preprocessing complete. 15.45/11.38 [2019-03-28 12:04:23,684 INFO L412 LassoAnalysis]: Checking for nontermination... 15.45/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.45/11.38 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 15.45/11.38 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:23,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 15.45/11.38 [2019-03-28 12:04:23,688 INFO L163 nArgumentSynthesizer]: Using integer mode. 15.45/11.38 [2019-03-28 12:04:23,692 INFO L445 LassoAnalysis]: Proved nontermination for one component. 15.45/11.38 [2019-03-28 12:04:23,693 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~post0=0} Honda state: {ULTIMATE.start_f_#t~post0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 15.45/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.45/11.38 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 15.45/11.38 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:23,721 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 15.45/11.38 [2019-03-28 12:04:23,721 INFO L163 nArgumentSynthesizer]: Using integer mode. 15.45/11.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.45/11.38 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 15.45/11.38 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:23,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 15.45/11.38 [2019-03-28 12:04:23,756 INFO L163 nArgumentSynthesizer]: Using integer mode. 15.45/11.38 [2019-03-28 12:04:24,075 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 15.45/11.38 [2019-03-28 12:04:24,078 INFO L216 LassoAnalysis]: Preferences: 15.45/11.38 [2019-03-28 12:04:24,097 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 15.45/11.38 [2019-03-28 12:04:24,097 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 15.45/11.38 [2019-03-28 12:04:24,097 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 15.45/11.38 [2019-03-28 12:04:24,097 INFO L127 ssoRankerPreferences]: Use exernal solver: false 15.45/11.38 [2019-03-28 12:04:24,097 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 15.45/11.38 [2019-03-28 12:04:24,097 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 15.45/11.38 [2019-03-28 12:04:24,097 INFO L130 ssoRankerPreferences]: Path of dumped script: 15.45/11.38 [2019-03-28 12:04:24,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 15.45/11.38 [2019-03-28 12:04:24,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 15.45/11.38 [2019-03-28 12:04:24,098 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 15.45/11.38 [2019-03-28 12:04:24,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:24,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.45/11.38 [2019-03-28 12:04:24,165 INFO L300 LassoAnalysis]: Preprocessing complete. 15.45/11.38 [2019-03-28 12:04:24,165 INFO L497 LassoAnalysis]: Using template 'affine'. 15.45/11.38 [2019-03-28 12:04:24,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.45/11.38 Termination analysis: LINEAR_WITH_GUESSES 15.45/11.38 Number of strict supporting invariants: 0 15.45/11.38 Number of non-strict supporting invariants: 1 15.45/11.38 Consider only non-deceasing supporting invariants: true 15.45/11.38 Simplify termination arguments: true 15.45/11.38 Simplify supporting invariants: trueOverapproximate stem: false 15.45/11.38 [2019-03-28 12:04:24,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.45/11.38 [2019-03-28 12:04:24,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.45/11.38 [2019-03-28 12:04:24,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.45/11.38 [2019-03-28 12:04:24,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.45/11.38 [2019-03-28 12:04:24,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.45/11.38 [2019-03-28 12:04:24,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.45/11.38 [2019-03-28 12:04:24,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.45/11.38 [2019-03-28 12:04:24,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.45/11.38 [2019-03-28 12:04:24,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.45/11.38 Termination analysis: LINEAR_WITH_GUESSES 15.45/11.38 Number of strict supporting invariants: 0 15.45/11.38 Number of non-strict supporting invariants: 1 15.45/11.38 Consider only non-deceasing supporting invariants: true 15.45/11.38 Simplify termination arguments: true 15.45/11.38 Simplify supporting invariants: trueOverapproximate stem: false 15.45/11.38 [2019-03-28 12:04:24,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.45/11.38 [2019-03-28 12:04:24,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.45/11.38 [2019-03-28 12:04:24,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.45/11.38 [2019-03-28 12:04:24,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.45/11.38 [2019-03-28 12:04:24,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.45/11.38 [2019-03-28 12:04:24,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.45/11.38 [2019-03-28 12:04:24,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.45/11.38 [2019-03-28 12:04:24,180 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 15.45/11.38 [2019-03-28 12:04:24,187 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 15.45/11.38 [2019-03-28 12:04:24,187 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 15.45/11.38 [2019-03-28 12:04:24,188 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 15.45/11.38 [2019-03-28 12:04:24,188 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 15.45/11.38 [2019-03-28 12:04:24,188 INFO L518 LassoAnalysis]: Proved termination. 15.45/11.38 [2019-03-28 12:04:24,188 INFO L520 LassoAnalysis]: Termination argument consisting of: 15.45/11.38 Ranking function f(ULTIMATE.start_f_~k, ULTIMATE.start_f_~i~0) = 1*ULTIMATE.start_f_~k - 1*ULTIMATE.start_f_~i~0 15.45/11.38 Supporting invariants [] 15.45/11.38 [2019-03-28 12:04:24,189 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 15.45/11.38 [2019-03-28 12:04:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.45/11.38 [2019-03-28 12:04:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.45/11.38 [2019-03-28 12:04:24,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 15.45/11.38 [2019-03-28 12:04:24,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.45/11.38 [2019-03-28 12:04:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.45/11.38 [2019-03-28 12:04:24,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core 15.45/11.38 [2019-03-28 12:04:24,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.45/11.38 [2019-03-28 12:04:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.45/11.38 [2019-03-28 12:04:24,239 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 15.45/11.38 [2019-03-28 12:04:24,239 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 15.45/11.38 [2019-03-28 12:04:24,239 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 22 transitions. cyclomatic complexity: 13 Second operand 3 states. 15.45/11.38 [2019-03-28 12:04:24,292 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 22 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 24 states and 47 transitions. Complement of second has 6 states. 15.45/11.38 [2019-03-28 12:04:24,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 15.45/11.38 [2019-03-28 12:04:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 15.45/11.38 [2019-03-28 12:04:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. 15.45/11.38 [2019-03-28 12:04:24,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 2 letters. Loop has 2 letters. 15.45/11.38 [2019-03-28 12:04:24,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.45/11.38 [2019-03-28 12:04:24,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 4 letters. Loop has 2 letters. 15.45/11.38 [2019-03-28 12:04:24,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.45/11.38 [2019-03-28 12:04:24,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 2 letters. Loop has 4 letters. 15.45/11.38 [2019-03-28 12:04:24,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.45/11.38 [2019-03-28 12:04:24,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 47 transitions. 15.45/11.38 [2019-03-28 12:04:24,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 15.45/11.38 [2019-03-28 12:04:24,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. 15.45/11.38 [2019-03-28 12:04:24,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 15.45/11.38 [2019-03-28 12:04:24,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 15.45/11.38 [2019-03-28 12:04:24,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 15.45/11.38 [2019-03-28 12:04:24,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 15.45/11.38 [2019-03-28 12:04:24,301 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.45/11.38 [2019-03-28 12:04:24,301 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.45/11.38 [2019-03-28 12:04:24,301 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.45/11.38 [2019-03-28 12:04:24,301 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 15.45/11.38 [2019-03-28 12:04:24,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 15.45/11.38 [2019-03-28 12:04:24,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 15.45/11.38 [2019-03-28 12:04:24,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 15.45/11.38 [2019-03-28 12:04:24,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:04:24 BasicIcfg 15.45/11.38 [2019-03-28 12:04:24,308 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 15.45/11.38 [2019-03-28 12:04:24,308 INFO L168 Benchmark]: Toolchain (without parser) took 2873.03 ms. Allocated memory is still 649.6 MB. Free memory was 559.7 MB in the beginning and 412.3 MB in the end (delta: 147.5 MB). Peak memory consumption was 147.5 MB. Max. memory is 50.3 GB. 15.45/11.38 [2019-03-28 12:04:24,310 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 15.45/11.38 [2019-03-28 12:04:24,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.27 ms. Allocated memory is still 649.6 MB. Free memory was 559.7 MB in the beginning and 548.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 15.45/11.38 [2019-03-28 12:04:24,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.43 ms. Allocated memory is still 649.6 MB. Free memory was 548.9 MB in the beginning and 615.9 MB in the end (delta: -67.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 15.45/11.38 [2019-03-28 12:04:24,311 INFO L168 Benchmark]: Boogie Preprocessor took 40.28 ms. Allocated memory is still 649.6 MB. Free memory was 615.9 MB in the beginning and 612.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 15.45/11.38 [2019-03-28 12:04:24,312 INFO L168 Benchmark]: RCFGBuilder took 231.53 ms. Allocated memory is still 649.6 MB. Free memory was 612.8 MB in the beginning and 597.4 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 50.3 GB. 15.45/11.38 [2019-03-28 12:04:24,313 INFO L168 Benchmark]: BlockEncodingV2 took 100.40 ms. Allocated memory is still 649.6 MB. Free memory was 597.4 MB in the beginning and 590.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 15.45/11.38 [2019-03-28 12:04:24,313 INFO L168 Benchmark]: TraceAbstraction took 160.35 ms. Allocated memory is still 649.6 MB. Free memory was 590.7 MB in the beginning and 581.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 15.45/11.38 [2019-03-28 12:04:24,314 INFO L168 Benchmark]: BuchiAutomizer took 1969.65 ms. Allocated memory is still 649.6 MB. Free memory was 579.8 MB in the beginning and 412.3 MB in the end (delta: 167.6 MB). Peak memory consumption was 167.6 MB. Max. memory is 50.3 GB. 15.45/11.38 [2019-03-28 12:04:24,317 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 15.45/11.38 --- Results --- 15.45/11.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 15.45/11.38 - StatisticsResult: Initial Icfg 15.45/11.38 12 locations, 17 edges 15.45/11.38 - StatisticsResult: Encoded RCFG 15.45/11.38 7 locations, 44 edges 15.45/11.38 * Results from de.uni_freiburg.informatik.ultimate.core: 15.45/11.38 - StatisticsResult: Toolchain Benchmarks 15.45/11.38 Benchmark results are: 15.45/11.38 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 15.45/11.38 * CACSL2BoogieTranslator took 262.27 ms. Allocated memory is still 649.6 MB. Free memory was 559.7 MB in the beginning and 548.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 15.45/11.38 * Boogie Procedure Inliner took 103.43 ms. Allocated memory is still 649.6 MB. Free memory was 548.9 MB in the beginning and 615.9 MB in the end (delta: -67.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 15.45/11.38 * Boogie Preprocessor took 40.28 ms. Allocated memory is still 649.6 MB. Free memory was 615.9 MB in the beginning and 612.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 15.45/11.38 * RCFGBuilder took 231.53 ms. Allocated memory is still 649.6 MB. Free memory was 612.8 MB in the beginning and 597.4 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 50.3 GB. 15.45/11.38 * BlockEncodingV2 took 100.40 ms. Allocated memory is still 649.6 MB. Free memory was 597.4 MB in the beginning and 590.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 15.45/11.38 * TraceAbstraction took 160.35 ms. Allocated memory is still 649.6 MB. Free memory was 590.7 MB in the beginning and 581.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 15.45/11.38 * BuchiAutomizer took 1969.65 ms. Allocated memory is still 649.6 MB. Free memory was 579.8 MB in the beginning and 412.3 MB in the end (delta: 167.6 MB). Peak memory consumption was 167.6 MB. Max. memory is 50.3 GB. 15.45/11.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 15.45/11.38 - AllSpecificationsHoldResult: All specifications hold 15.45/11.38 We were not able to verify any specifiation because the program does not contain any specification. 15.45/11.38 - InvariantResult [Line: 13]: Loop Invariant 15.45/11.38 Derived loop invariant: 1 15.45/11.38 - InvariantResult [Line: 4]: Loop Invariant 15.45/11.38 Derived loop invariant: 1 15.45/11.38 - InvariantResult [Line: 4]: Loop Invariant 15.45/11.38 Derived loop invariant: 1 15.45/11.38 - InvariantResult [Line: 6]: Loop Invariant 15.45/11.38 Derived loop invariant: 1 15.45/11.38 - StatisticsResult: Ultimate Automizer benchmark data 15.45/11.38 CFG has 1 procedures, 7 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 15.45/11.38 - StatisticsResult: Constructed decomposition of program 15.45/11.38 Your program was decomposed into 3 terminating modules (1 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function l + -1 * j and consists of 3 locations. One nondeterministic module has affine ranking function k + -1 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. 15.45/11.38 - StatisticsResult: Timing statistics 15.45/11.38 BüchiAutomizer plugin needed 1.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 52 SDslu, 45 SDs, 0 SdLazy, 101 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp77 ukn100 mio100 lsp100 div425 bol100 ite100 ukn100 eq140 hnf45 smp90 dnf100 smp100 tf106 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s 15.45/11.38 - TerminationAnalysisResult: Termination proven 15.45/11.38 Buchi Automizer proved that your program is terminating 15.45/11.38 RESULT: Ultimate proved your program to be correct! 15.45/11.38 !SESSION 2019-03-28 12:04:15.857 ----------------------------------------------- 15.45/11.38 eclipse.buildId=unknown 15.45/11.38 java.version=1.8.0_181 15.45/11.38 java.vendor=Oracle Corporation 15.45/11.38 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 15.45/11.38 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 15.45/11.38 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 15.45/11.38 15.45/11.38 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:04:24.552 15.45/11.38 !MESSAGE The workspace will exit with unsaved changes in this session. 15.45/11.38 Received shutdown request... 15.45/11.38 Ultimate: 15.45/11.38 GTK+ Version Check 15.45/11.38 EOF