./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb53649e57c73811eb036860baf1102917fa8259 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:26:40,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:26:40,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:26:40,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:26:40,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:26:40,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:26:40,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:26:40,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:26:40,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:26:40,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:26:40,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:26:40,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:26:40,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:26:40,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:26:40,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:26:40,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:26:40,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:26:40,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:26:40,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:26:40,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:26:40,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:26:40,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:26:40,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:26:40,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:26:40,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:26:40,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:26:40,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:26:40,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:26:40,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:26:40,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:26:40,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:26:40,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:26:40,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:26:40,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:26:40,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:26:40,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:26:40,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:26:40,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:26:40,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:26:40,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:26:40,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:26:40,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:26:40,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:26:40,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:26:40,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:26:40,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:26:40,149 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:26:40,149 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:26:40,150 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:26:40,150 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:26:40,150 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:26:40,150 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:26:40,151 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:26:40,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:26:40,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:26:40,153 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:26:40,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:26:40,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:26:40,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:26:40,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:26:40,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:26:40,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:26:40,154 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:26:40,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:26:40,155 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:26:40,155 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:26:40,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:26:40,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:26:40,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:26:40,156 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:26:40,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:26:40,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:26:40,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:26:40,160 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:26:40,161 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:26:40,161 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb53649e57c73811eb036860baf1102917fa8259 [2019-11-28 21:26:40,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:26:40,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:26:40,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:26:40,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:26:40,530 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:26:40,531 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2019-11-28 21:26:40,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6777b1a49/6203ff64588c4b0aa5a148a23f59b469/FLAGe91782db4 [2019-11-28 21:26:41,200 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:26:41,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2019-11-28 21:26:41,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6777b1a49/6203ff64588c4b0aa5a148a23f59b469/FLAGe91782db4 [2019-11-28 21:26:41,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6777b1a49/6203ff64588c4b0aa5a148a23f59b469 [2019-11-28 21:26:41,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:26:41,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:26:41,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:41,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:26:41,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:26:41,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:41" (1/1) ... [2019-11-28 21:26:41,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee01756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:41, skipping insertion in model container [2019-11-28 21:26:41,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:41" (1/1) ... [2019-11-28 21:26:41,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:26:41,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:26:42,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:42,141 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:26:42,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:42,290 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:26:42,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42 WrapperNode [2019-11-28 21:26:42,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:42,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:42,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:26:42,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:26:42,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... [2019-11-28 21:26:42,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... [2019-11-28 21:26:42,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:42,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:26:42,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:26:42,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:26:42,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... [2019-11-28 21:26:42,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... [2019-11-28 21:26:42,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... [2019-11-28 21:26:42,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... [2019-11-28 21:26:42,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... [2019-11-28 21:26:42,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... [2019-11-28 21:26:42,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... [2019-11-28 21:26:42,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:26:42,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:26:42,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:26:42,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:26:42,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:42,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 21:26:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 21:26:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 21:26:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 21:26:42,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:26:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 21:26:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:26:42,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:26:42,793 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:26:42,793 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-28 21:26:42,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:42 BoogieIcfgContainer [2019-11-28 21:26:42,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:26:42,795 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:26:42,795 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:26:42,799 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:26:42,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:42,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:26:41" (1/3) ... [2019-11-28 21:26:42,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28416846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:42, skipping insertion in model container [2019-11-28 21:26:42,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:42,802 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:42" (2/3) ... [2019-11-28 21:26:42,802 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28416846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:42, skipping insertion in model container [2019-11-28 21:26:42,802 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:42,802 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:42" (3/3) ... [2019-11-28 21:26:42,804 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_1.i [2019-11-28 21:26:42,852 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:26:42,852 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:26:42,853 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:26:42,853 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:26:42,853 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:26:42,853 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:26:42,854 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:26:42,854 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:26:42,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 21:26:42,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:26:42,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:42,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:42,900 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:42,901 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:42,901 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:26:42,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 21:26:42,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:26:42,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:42,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:42,904 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:42,904 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:42,910 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 10#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 4#L526true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 16#L529true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 11#L766true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 14#L767-3true [2019-11-28 21:26:42,910 INFO L796 eck$LassoCheckResult]: Loop: 14#L767-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 6#L526-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 17#L529-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 9#L769true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 13#L767-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 14#L767-3true [2019-11-28 21:26:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 21:26:42,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:42,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116167077] [2019-11-28 21:26:42,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:43,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116167077] [2019-11-28 21:26:43,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:43,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:26:43,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092166173] [2019-11-28 21:26:43,129 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2019-11-28 21:26:43,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:43,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331189181] [2019-11-28 21:26:43,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:43,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:43,469 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-28 21:26:43,583 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 21:26:43,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:43,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:26:43,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:26:43,606 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 4 states. [2019-11-28 21:26:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:43,688 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-28 21:26:43,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:26:43,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-11-28 21:26:43,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-28 21:26:43,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 25 transitions. [2019-11-28 21:26:43,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 21:26:43,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 21:26:43,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-11-28 21:26:43,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:43,702 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-28 21:26:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-11-28 21:26:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-11-28 21:26:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 21:26:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-28 21:26:43,733 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-28 21:26:43,733 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-28 21:26:43,734 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:26:43,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-11-28 21:26:43,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-28 21:26:43,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:43,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:43,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:43,736 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 21:26:43,736 INFO L794 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 66#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 59#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 60#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 67#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 68#L767-3 [2019-11-28 21:26:43,736 INFO L796 eck$LassoCheckResult]: Loop: 68#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 62#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 63#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 64#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 65#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 68#L767-3 [2019-11-28 21:26:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:43,737 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2019-11-28 21:26:43,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:43,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131734115] [2019-11-28 21:26:43,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:43,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2019-11-28 21:26:43,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:43,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702545705] [2019-11-28 21:26:43,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:43,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2019-11-28 21:26:43,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:43,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412420585] [2019-11-28 21:26:43,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:43,913 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:44,128 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-28 21:26:44,479 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-11-28 21:26:44,594 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 21:26:44,609 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:44,611 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:44,611 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:44,611 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:44,611 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:44,612 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:44,612 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:44,620 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:44,620 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration2_Lasso [2019-11-28 21:26:44,620 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:44,621 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:44,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:44,991 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-28 21:26:45,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:45,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:45,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:45,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:45,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:45,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:45,776 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-28 21:26:45,886 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:45,892 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:45,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:45,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:45,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:45,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:45,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:45,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:45,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:45,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:45,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:45,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:45,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:45,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:45,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:45,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:45,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:45,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:45,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:45,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:45,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:45,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:45,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:45,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:45,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:45,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:45,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:45,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:46,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:46,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:46,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:46,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:46,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:46,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:46,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:46,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:46,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:46,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:46,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:46,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:46,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:46,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:46,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:46,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:46,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:46,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:46,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:46,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:46,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:46,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:46,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:46,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:46,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:46,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:46,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:46,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:46,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:46,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:46,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:46,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:46,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:46,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:46,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:46,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:46,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:46,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:46,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:46,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:46,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:46,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:46,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:46,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:46,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:46,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:46,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:46,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:46,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:46,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:46,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:46,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:46,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:46,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:46,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:46,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:46,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:46,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:46,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:46,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:46,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:46,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:46,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:46,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:46,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:46,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:46,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:46,285 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:46,355 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-28 21:26:46,356 INFO L444 ModelExtractionUtils]: 18 out of 43 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:46,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:26:46,370 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 21:26:46,371 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:46,372 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~0) = -2*ULTIMATE.start_entry_point_~i~0 + 19 Supporting invariants [-1*ULTIMATE.start_entry_point_~len~0 + 10 >= 0] [2019-11-28 21:26:46,419 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:26:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:46,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 21:26:46,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:46,555 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 21:26:46,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:46,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 21:26:46,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-28 21:26:46,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 27 states and 36 transitions. Complement of second has 7 states. [2019-11-28 21:26:46,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 21:26:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 21:26:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-28 21:26:46,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-28 21:26:46,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:46,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-28 21:26:46,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:46,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 21:26:46,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:46,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-28 21:26:46,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:26:46,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2019-11-28 21:26:46,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 21:26:46,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 21:26:46,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-28 21:26:46,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:46,694 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-28 21:26:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-28 21:26:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-28 21:26:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:26:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 21:26:46,698 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 21:26:46,699 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 21:26:46,699 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:26:46,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 21:26:46,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:26:46,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:46,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:46,701 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:46,702 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:46,702 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 193#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 183#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 184#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 194#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 195#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 181#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 182#L773-3 [2019-11-28 21:26:46,702 INFO L796 eck$LassoCheckResult]: Loop: 182#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 185#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 182#L773-3 [2019-11-28 21:26:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:46,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968475, now seen corresponding path program 1 times [2019-11-28 21:26:46,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:46,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196329812] [2019-11-28 21:26:46,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:46,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196329812] [2019-11-28 21:26:46,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:46,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:26:46,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099049598] [2019-11-28 21:26:46,778 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:46,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 1 times [2019-11-28 21:26:46,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:46,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542633253] [2019-11-28 21:26:46,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:46,789 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:46,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:46,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:26:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:26:46,821 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-28 21:26:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:46,847 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-11-28 21:26:46,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:26:46,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-11-28 21:26:46,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:26:46,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2019-11-28 21:26:46,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 21:26:46,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 21:26:46,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-28 21:26:46,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:46,851 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 21:26:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-28 21:26:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-11-28 21:26:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:26:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-28 21:26:46,853 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 21:26:46,853 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 21:26:46,854 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:26:46,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-11-28 21:26:46,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:26:46,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:46,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:46,855 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:46,855 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:46,855 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 244#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 234#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 235#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 245#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 246#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 237#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 238#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 241#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 232#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 233#L773-3 [2019-11-28 21:26:46,856 INFO L796 eck$LassoCheckResult]: Loop: 233#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 236#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 233#L773-3 [2019-11-28 21:26:46,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:46,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218535, now seen corresponding path program 1 times [2019-11-28 21:26:46,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:46,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904091325] [2019-11-28 21:26:46,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:46,884 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:46,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:46,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 2 times [2019-11-28 21:26:46,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:46,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862628872] [2019-11-28 21:26:46,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:46,896 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2113388251, now seen corresponding path program 1 times [2019-11-28 21:26:46,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:46,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849509773] [2019-11-28 21:26:46,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:46,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849509773] [2019-11-28 21:26:46,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:46,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:26:46,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210710544] [2019-11-28 21:26:46,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:46,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:26:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:26:46,978 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 21:26:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:47,015 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-11-28 21:26:47,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:26:47,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-11-28 21:26:47,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:26:47,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2019-11-28 21:26:47,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 21:26:47,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 21:26:47,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-11-28 21:26:47,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:47,018 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-28 21:26:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-11-28 21:26:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-11-28 21:26:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:26:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 21:26:47,021 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 21:26:47,021 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 21:26:47,021 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:26:47,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-28 21:26:47,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:26:47,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:47,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:47,023 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:47,024 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:47,024 INFO L794 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 298#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 288#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 289#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 299#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 300#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 293#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 294#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 296#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 297#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 302#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 286#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 287#L773-3 [2019-11-28 21:26:47,024 INFO L796 eck$LassoCheckResult]: Loop: 287#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 290#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 287#L773-3 [2019-11-28 21:26:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2113443111, now seen corresponding path program 1 times [2019-11-28 21:26:47,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:47,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068903451] [2019-11-28 21:26:47,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:47,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068903451] [2019-11-28 21:26:47,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:47,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 21:26:47,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169799249] [2019-11-28 21:26:47,065 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:47,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 3 times [2019-11-28 21:26:47,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:47,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945338930] [2019-11-28 21:26:47,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:47,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:26:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:26:47,105 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-28 21:26:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:47,147 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-11-28 21:26:47,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:26:47,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-11-28 21:26:47,150 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 21:26:47,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2019-11-28 21:26:47,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 21:26:47,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 21:26:47,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-11-28 21:26:47,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:47,151 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-28 21:26:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-11-28 21:26:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-28 21:26:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:26:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 21:26:47,157 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 21:26:47,157 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 21:26:47,157 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:26:47,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-28 21:26:47,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:26:47,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:47,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:47,160 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:47,161 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:47,161 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 351#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 341#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 342#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 352#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 353#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 346#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 347#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 349#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 350#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 355#L767-3 assume !(entry_point_~i~0 < entry_point_~len~0); 339#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 340#L773-3 [2019-11-28 21:26:47,161 INFO L796 eck$LassoCheckResult]: Loop: 340#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 343#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 340#L773-3 [2019-11-28 21:26:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2056184809, now seen corresponding path program 1 times [2019-11-28 21:26:47,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:47,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071290272] [2019-11-28 21:26:47,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:47,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071290272] [2019-11-28 21:26:47,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086764777] [2019-11-28 21:26:47,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 21:26:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:47,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:47,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:47,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 21:26:47,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-28 21:26:47,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854343706] [2019-11-28 21:26:47,385 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:26:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 4 times [2019-11-28 21:26:47,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:47,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861899835] [2019-11-28 21:26:47,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:47,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:47,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 21:26:47,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-28 21:26:47,438 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-28 21:26:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:47,481 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-11-28 21:26:47,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:26:47,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-11-28 21:26:47,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 21:26:47,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2019-11-28 21:26:47,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 21:26:47,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 21:26:47,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2019-11-28 21:26:47,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 21:26:47,487 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-28 21:26:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2019-11-28 21:26:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-11-28 21:26:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 21:26:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-28 21:26:47,492 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-28 21:26:47,492 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-28 21:26:47,493 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 21:26:47,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-11-28 21:26:47,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 21:26:47,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:47,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:47,496 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:47,496 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 21:26:47,496 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 443#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 433#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 434#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 444#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 445#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 448#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 449#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 441#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 442#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 447#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 436#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 437#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 440#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 431#L772 entry_point_~j~0 := entry_point_~i~0 - 1; 432#L773-3 [2019-11-28 21:26:47,497 INFO L796 eck$LassoCheckResult]: Loop: 432#L773-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 435#L773-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 432#L773-3 [2019-11-28 21:26:47,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:47,497 INFO L82 PathProgramCache]: Analyzing trace with hash 979558027, now seen corresponding path program 1 times [2019-11-28 21:26:47,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:47,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854132294] [2019-11-28 21:26:47,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:47,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2499, now seen corresponding path program 5 times [2019-11-28 21:26:47,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:47,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13476921] [2019-11-28 21:26:47,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,572 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:47,577 INFO L82 PathProgramCache]: Analyzing trace with hash 757427661, now seen corresponding path program 1 times [2019-11-28 21:26:47,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:47,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285347949] [2019-11-28 21:26:47,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:47,611 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:48,313 WARN L192 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 144 [2019-11-28 21:26:48,490 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-28 21:26:48,494 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:26:48,495 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:26:48,495 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:26:48,495 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:26:48,495 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:26:48,495 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:48,495 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:26:48,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:26:48,496 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_1.i_Iteration7_Lasso [2019-11-28 21:26:48,496 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:26:48,496 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:26:48,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,827 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-28 21:26:48,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:48,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:26:49,385 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2019-11-28 21:26:49,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:26:49,446 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:49,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:49,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:49,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:49,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:49,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:49,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:49,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:26:49,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:49,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:49,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:49,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:49,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:26:49,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:26:49,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:26:49,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:26:49,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:26:49,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:26:49,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:26:49,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:26:49,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:26:49,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:26:49,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,789 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:26:49,819 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 21:26:49,819 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:49,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:26:49,828 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 21:26:49,829 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:26:49,829 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2019-11-28 21:26:49,851 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 21:26:49,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:49,885 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:26:49,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:49,893 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:26:49,894 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:26:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:49,904 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 21:26:49,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 21:26:49,915 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2019-11-28 21:26:49,916 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 [2019-11-28 21:26:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:26:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-28 21:26:49,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-28 21:26:49,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-28 21:26:49,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-28 21:26:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:26:49,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-28 21:26:49,919 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:26:49,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-11-28 21:26:49,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:26:49,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:26:49,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:26:49,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:49,919 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:26:49,920 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:26:49,920 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:26:49,920 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 21:26:49,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:26:49,920 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:26:49,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:26:49,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:26:49 BoogieIcfgContainer [2019-11-28 21:26:49,927 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:26:49,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:26:49,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:26:49,928 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:26:49,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:42" (3/4) ... [2019-11-28 21:26:49,932 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:26:49,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:26:49,934 INFO L168 Benchmark]: Toolchain (without parser) took 8405.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -92.0 MB). Peak memory consumption was 224.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:49,934 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:49,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:49,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:49,936 INFO L168 Benchmark]: Boogie Preprocessor took 40.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:49,937 INFO L168 Benchmark]: RCFGBuilder took 403.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:49,938 INFO L168 Benchmark]: BuchiAutomizer took 7131.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 205.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:49,938 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:49,941 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 761.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 403.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7131.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 205.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 19 and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 113 SDtfs, 139 SDslu, 109 SDs, 0 SdLazy, 92 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital255 mio100 ax111 hnf101 lsp83 ukn56 mio100 lsp58 div100 bol100 ite100 ukn100 eq191 hnf90 smp100 dnf109 smp92 tf100 neg98 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...