./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/diff-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-memory-alloca/diff-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 0c73140129db08253eb2666e014a272764010e16 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:32:35,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:32:35,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:32:35,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:32:35,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:32:35,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:32:35,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:32:35,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:32:35,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:32:35,412 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:32:35,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:32:35,413 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:32:35,417 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:32:35,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:32:35,422 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:32:35,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:32:35,425 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:32:35,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:32:35,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:32:35,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:32:35,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:32:35,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:32:35,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:32:35,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:32:35,436 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:32:35,437 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:32:35,438 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:32:35,438 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:32:35,439 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:32:35,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:32:35,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:32:35,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:32:35,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:32:35,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:32:35,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:32:35,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:32:35,443 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:32:35,462 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:32:35,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:32:35,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:32:35,464 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:32:35,464 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:32:35,464 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:32:35,465 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:32:35,465 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:32:35,465 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:32:35,465 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:32:35,465 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:32:35,466 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:32:35,467 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:32:35,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:32:35,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:32:35,467 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:32:35,467 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:32:35,467 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:32:35,468 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:32:35,468 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:32:35,468 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:32:35,468 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:32:35,468 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:32:35,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:32:35,470 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:32:35,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:32:35,470 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:32:35,470 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:32:35,471 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:32:35,472 INFO L133 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c73140129db08253eb2666e014a272764010e16 [2019-01-14 02:32:35,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:32:35,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:32:35,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:32:35,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:32:35,541 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:32:35,542 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2019-01-14 02:32:35,604 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55edf2a5/a7833428a5eb45e2a27c4d5ea6eb4f99/FLAGfa619677b [2019-01-14 02:32:36,132 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:32:36,132 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/diff-alloca_true-termination.c.i [2019-01-14 02:32:36,146 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55edf2a5/a7833428a5eb45e2a27c4d5ea6eb4f99/FLAGfa619677b [2019-01-14 02:32:36,438 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55edf2a5/a7833428a5eb45e2a27c4d5ea6eb4f99 [2019-01-14 02:32:36,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:32:36,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:32:36,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:32:36,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:32:36,451 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:32:36,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:32:36" (1/1) ... [2019-01-14 02:32:36,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348d6f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:36, skipping insertion in model container [2019-01-14 02:32:36,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:32:36" (1/1) ... [2019-01-14 02:32:36,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:32:36,527 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:32:36,925 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:32:36,941 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:32:37,058 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:32:37,112 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:32:37,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37 WrapperNode [2019-01-14 02:32:37,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:32:37,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:32:37,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:32:37,115 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:32:37,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (1/1) ... [2019-01-14 02:32:37,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (1/1) ... [2019-01-14 02:32:37,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:32:37,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:32:37,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:32:37,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:32:37,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (1/1) ... [2019-01-14 02:32:37,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (1/1) ... [2019-01-14 02:32:37,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (1/1) ... [2019-01-14 02:32:37,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (1/1) ... [2019-01-14 02:32:37,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (1/1) ... [2019-01-14 02:32:37,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (1/1) ... [2019-01-14 02:32:37,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (1/1) ... [2019-01-14 02:32:37,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:32:37,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:32:37,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:32:37,206 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:32:37,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (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-01-14 02:32:37,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:32:37,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:32:37,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:32:37,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:32:37,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:32:37,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:32:37,664 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:32:37,665 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:32:37,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:37 BoogieIcfgContainer [2019-01-14 02:32:37,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:32:37,667 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:32:37,667 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:32:37,670 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:32:37,671 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:37,671 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:32:36" (1/3) ... [2019-01-14 02:32:37,672 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17d70cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:32:37, skipping insertion in model container [2019-01-14 02:32:37,673 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:37,673 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:37" (2/3) ... [2019-01-14 02:32:37,673 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17d70cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:32:37, skipping insertion in model container [2019-01-14 02:32:37,673 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:37,673 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:37" (3/3) ... [2019-01-14 02:32:37,675 INFO L375 chiAutomizerObserver]: Analyzing ICFG diff-alloca_true-termination.c.i [2019-01-14 02:32:37,740 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:32:37,740 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:32:37,741 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:32:37,741 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:32:37,741 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:32:37,742 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:32:37,742 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:32:37,742 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:32:37,742 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:32:37,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:32:37,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:32:37,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:37,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:37,792 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:37,792 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:32:37,792 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:32:37,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:32:37,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:32:37,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:37,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:37,796 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:37,796 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:32:37,805 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 9#L574true assume !(main_~Alen~0 < 1); 14#L574-2true assume !(main_~Blen~0 < 1); 7#L577-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 12#L554-2true [2019-01-14 02:32:37,807 INFO L796 eck$LassoCheckResult]: Loop: 12#L554-2true assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 5#L558-2true assume !true; 6#L557-2true assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 11#L564-1true diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 12#L554-2true [2019-01-14 02:32:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:37,814 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:32:37,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:37,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:37,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1679350, now seen corresponding path program 1 times [2019-01-14 02:32:37,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:37,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:37,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:38,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:32:38,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:32:38,018 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:32:38,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:32:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:32:38,034 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-14 02:32:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:32:38,041 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-01-14 02:32:38,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:32:38,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-01-14 02:32:38,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:32:38,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 15 transitions. [2019-01-14 02:32:38,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:32:38,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:32:38,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2019-01-14 02:32:38,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:38,055 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-14 02:32:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2019-01-14 02:32:38,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:32:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:32:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-01-14 02:32:38,088 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-14 02:32:38,088 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-01-14 02:32:38,089 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:32:38,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-01-14 02:32:38,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:32:38,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:38,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:38,090 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:38,090 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:32:38,091 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 37#L574 assume !(main_~Alen~0 < 1); 38#L574-2 assume !(main_~Blen~0 < 1); 44#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 42#L554-2 [2019-01-14 02:32:38,091 INFO L796 eck$LassoCheckResult]: Loop: 42#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 40#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 45#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 41#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 42#L554-2 [2019-01-14 02:32:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 02:32:38,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:38,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:38,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:38,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:38,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:38,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1669740, now seen corresponding path program 1 times [2019-01-14 02:32:38,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:38,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1298476337, now seen corresponding path program 1 times [2019-01-14 02:32:38,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:38,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:38,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:38,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:38,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:38,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:32:38,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:32:38,652 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-14 02:32:38,891 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 02:32:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:32:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:32:38,893 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-01-14 02:32:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:32:38,999 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2019-01-14 02:32:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:32:39,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2019-01-14 02:32:39,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:32:39,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2019-01-14 02:32:39,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:32:39,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:32:39,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2019-01-14 02:32:39,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:39,006 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-01-14 02:32:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2019-01-14 02:32:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-14 02:32:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:32:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:32:39,009 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:32:39,009 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:32:39,009 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:32:39,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-01-14 02:32:39,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:32:39,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:39,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:39,011 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:39,011 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:32:39,011 INFO L794 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 73#L574 assume !(main_~Alen~0 < 1); 76#L574-2 assume !(main_~Blen~0 < 1); 81#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 78#L554-2 [2019-01-14 02:32:39,011 INFO L796 eck$LassoCheckResult]: Loop: 78#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 80#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 74#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 75#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 82#L557-2 assume 0 == diff_~found~0;call diff_#t~mem5 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call write~int(diff_#t~mem5, diff_~D.base, diff_~D.offset + 4 * diff_~k~0, 4);havoc diff_#t~mem5;diff_#t~post6 := diff_~k~0;diff_~k~0 := 1 + diff_#t~post6;havoc diff_#t~post6; 77#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 78#L554-2 [2019-01-14 02:32:39,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:39,012 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 3 times [2019-01-14 02:32:39,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:39,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:39,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:39,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183209, now seen corresponding path program 1 times [2019-01-14 02:32:39,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:39,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:39,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:39,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:39,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:32:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:32:39,098 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:32:39,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:32:39,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:32:39,099 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 02:32:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:32:39,172 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-01-14 02:32:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:32:39,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-14 02:32:39,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:32:39,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2019-01-14 02:32:39,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 02:32:39,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:32:39,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-01-14 02:32:39,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:39,177 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-14 02:32:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-01-14 02:32:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2019-01-14 02:32:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:32:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-01-14 02:32:39,181 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 02:32:39,181 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 02:32:39,181 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:32:39,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-01-14 02:32:39,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:32:39,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:39,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:39,184 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:39,184 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:32:39,185 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 108#L574 assume !(main_~Alen~0 < 1); 112#L574-2 assume !(main_~Blen~0 < 1); 118#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 114#L554-2 [2019-01-14 02:32:39,186 INFO L796 eck$LassoCheckResult]: Loop: 114#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 116#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 109#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 110#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 117#L557-2 assume !(0 == diff_~found~0); 113#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 114#L554-2 [2019-01-14 02:32:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 4 times [2019-01-14 02:32:39,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:39,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:39,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:39,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:39,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:39,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1606183271, now seen corresponding path program 1 times [2019-01-14 02:32:39,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:39,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:39,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1998160148, now seen corresponding path program 1 times [2019-01-14 02:32:39,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:39,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:39,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:39,579 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-01-14 02:32:39,717 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:32:40,266 WARN L181 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-01-14 02:32:40,580 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-01-14 02:32:40,592 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:40,594 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:40,594 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:40,594 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:40,594 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:40,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:40,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:40,595 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:40,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:32:40,595 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:40,595 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:40,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:40,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:40,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:40,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:40,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:40,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:40,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-01-14 02:32:40,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:40,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-01-14 02:32:40,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-01-14 02:32:40,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:41,315 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-01-14 02:32:41,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:41,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:41,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:41,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:41,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:41,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:41,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:43,221 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-14 02:32:43,570 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:43,575 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:43,577 INFO L122 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-01-14 02:32:43,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,586 INFO L122 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-01-14 02:32:43,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,590 INFO L122 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-01-14 02:32:43,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,603 INFO L122 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-01-14 02:32:43,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,611 INFO L122 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-01-14 02:32:43,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,622 INFO L122 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-01-14 02:32:43,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,626 INFO L122 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-01-14 02:32:43,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,643 INFO L122 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-01-14 02:32:43,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,648 INFO L122 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-01-14 02:32:43,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,659 INFO L122 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-01-14 02:32:43,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,671 INFO L122 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-01-14 02:32:43,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,675 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:43,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,701 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:32:43,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,775 INFO L122 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-01-14 02:32:43,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,780 INFO L122 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-01-14 02:32:43,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,785 INFO L122 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-01-14 02:32:43,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,794 INFO L122 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-01-14 02:32:43,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,814 INFO L122 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-01-14 02:32:43,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,826 INFO L122 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-01-14 02:32:43,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:43,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:43,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:43,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:43,829 INFO L122 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-01-14 02:32:43,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:43,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:43,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:43,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:43,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:43,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:43,862 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:43,898 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 02:32:43,899 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:32:43,901 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:43,902 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:43,903 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:43,903 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~i~0, ULTIMATE.start_diff_~A.offset, v_rep(select #length ULTIMATE.start_diff_~A.base)_1) = -4*ULTIMATE.start_diff_~i~0 - 1*ULTIMATE.start_diff_~A.offset + 1*v_rep(select #length ULTIMATE.start_diff_~A.base)_1 Supporting invariants [] [2019-01-14 02:32:44,089 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 02:32:44,096 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:32:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:44,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:44,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:44,179 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-01-14 02:32:44,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 02:32:44,297 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2019-01-14 02:32:44,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:32:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 02:32:44,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 02:32:44,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:44,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-14 02:32:44,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:44,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2019-01-14 02:32:44,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:44,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2019-01-14 02:32:44,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:44,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 24 transitions. [2019-01-14 02:32:44,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:32:44,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:32:44,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-01-14 02:32:44,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:44,305 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 02:32:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-01-14 02:32:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-14 02:32:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:32:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-01-14 02:32:44,307 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-01-14 02:32:44,308 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-01-14 02:32:44,308 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:32:44,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2019-01-14 02:32:44,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:44,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:44,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:44,309 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:32:44,309 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:32:44,309 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 258#L574 assume !(main_~Alen~0 < 1); 259#L574-2 assume !(main_~Blen~0 < 1); 270#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 268#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 261#L558-2 [2019-01-14 02:32:44,309 INFO L796 eck$LassoCheckResult]: Loop: 261#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 260#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 261#L558-2 [2019-01-14 02:32:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash 889572242, now seen corresponding path program 1 times [2019-01-14 02:32:44,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:44,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:44,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:44,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:44,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-01-14 02:32:44,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:44,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:44,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:44,341 INFO L82 PathProgramCache]: Analyzing trace with hash 180433719, now seen corresponding path program 1 times [2019-01-14 02:32:44,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:44,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:44,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:44,569 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 02:32:45,059 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-01-14 02:32:45,619 WARN L181 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-14 02:32:45,622 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:45,622 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:45,622 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:45,622 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:45,622 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:45,622 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:45,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:45,623 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:45,623 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:32:45,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:45,623 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:45,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:45,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:46,078 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-01-14 02:32:46,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:46,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:46,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:46,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:46,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:46,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:46,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:46,574 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 02:32:46,951 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 02:32:48,062 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-14 02:32:48,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:48,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:48,156 INFO L122 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-01-14 02:32:48,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:48,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:48,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,165 INFO L122 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-01-14 02:32:48,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:48,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:48,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:48,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,170 INFO L122 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-01-14 02:32:48,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:48,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:48,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,177 INFO L122 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-01-14 02:32:48,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:48,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:48,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:48,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,183 INFO L122 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-01-14 02:32:48,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:48,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:48,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:48,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,189 INFO L122 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-01-14 02:32:48,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:48,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:48,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,197 INFO L122 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-01-14 02:32:48,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:48,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:48,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:48,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,199 INFO L122 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-01-14 02:32:48,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:48,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:48,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:48,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,208 INFO L122 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-01-14 02:32:48,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:48,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:48,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,215 INFO L122 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-01-14 02:32:48,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:48,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:48,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:48,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:48,220 INFO L122 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-01-14 02:32:48,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:48,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:48,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:48,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:48,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:48,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:48,293 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:48,346 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:32:48,347 INFO L444 ModelExtractionUtils]: 68 out of 73 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:32:48,347 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:48,350 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:48,351 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:48,352 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~B.offset, v_rep(select #length ULTIMATE.start_diff_~B.base)_2, ULTIMATE.start_diff_~j~0) = -1*ULTIMATE.start_diff_~B.offset + 1*v_rep(select #length ULTIMATE.start_diff_~B.base)_2 - 4*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2019-01-14 02:32:48,730 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 02:32:48,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:32:48,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:48,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:48,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:48,941 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-01-14 02:32:48,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:32:49,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2019-01-14 02:32:49,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:32:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 02:32:49,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:32:49,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:49,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:32:49,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:49,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:32:49,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:49,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-01-14 02:32:49,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:49,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 39 transitions. [2019-01-14 02:32:49,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:32:49,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:32:49,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 39 transitions. [2019-01-14 02:32:49,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:49,023 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-01-14 02:32:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 39 transitions. [2019-01-14 02:32:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-01-14 02:32:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:32:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-14 02:32:49,026 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 02:32:49,026 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 02:32:49,026 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:32:49,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-01-14 02:32:49,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:49,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:49,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:49,030 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:49,030 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:32:49,030 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 420#L574 assume !(main_~Alen~0 < 1); 425#L574-2 assume !(main_~Blen~0 < 1); 433#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 429#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 430#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 437#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 438#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 435#L557-2 assume !(0 == diff_~found~0); 426#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 427#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 422#L558-2 [2019-01-14 02:32:49,030 INFO L796 eck$LassoCheckResult]: Loop: 422#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 421#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 422#L558-2 [2019-01-14 02:32:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1811575378, now seen corresponding path program 1 times [2019-01-14 02:32:49,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:49,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:32:49,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:32:49,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:32:49,105 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:32:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2019-01-14 02:32:49,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:49,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:49,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:49,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:49,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:32:49,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:32:49,188 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 02:32:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:32:49,205 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2019-01-14 02:32:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:32:49,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2019-01-14 02:32:49,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:49,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 31 transitions. [2019-01-14 02:32:49,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:32:49,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:32:49,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-01-14 02:32:49,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:49,210 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-14 02:32:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-01-14 02:32:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-01-14 02:32:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:32:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-01-14 02:32:49,212 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-01-14 02:32:49,212 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-01-14 02:32:49,212 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:32:49,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2019-01-14 02:32:49,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:49,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:49,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:49,215 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:49,215 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:32:49,215 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 467#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_~Alen~0, main_~Blen~0, main_~A~0.base, main_~A~0.offset, main_~B~0.base, main_~B~0.offset, main_~D~0.base, main_~D~0.offset;main_~Alen~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~Blen~0 := main_#t~nondet9;havoc main_#t~nondet9; 468#L574 assume !(main_~Alen~0 < 1); 473#L574-2 assume !(main_~Blen~0 < 1); 480#L577-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~A~0.base, main_~A~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(4 * main_~Blen~0);main_~B~0.base, main_~B~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~Alen~0);main_~D~0.base, main_~D~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;diff_#in~A.base, diff_#in~A.offset, diff_#in~Alen, diff_#in~B.base, diff_#in~B.offset, diff_#in~Blen, diff_#in~D.base, diff_#in~D.offset := main_~A~0.base, main_~A~0.offset, main_~Alen~0, main_~B~0.base, main_~B~0.offset, main_~Blen~0, main_~D~0.base, main_~D~0.offset;havoc diff_#t~mem2, diff_#t~mem3, diff_#t~post4, diff_#t~mem5, diff_#t~post6, diff_#t~post7, diff_~j~0, diff_~A.base, diff_~A.offset, diff_~Alen, diff_~B.base, diff_~B.offset, diff_~Blen, diff_~D.base, diff_~D.offset, diff_~k~0, diff_~i~0, diff_~l1~0, diff_~l2~0, diff_~found~0;diff_~A.base, diff_~A.offset := diff_#in~A.base, diff_#in~A.offset;diff_~Alen := diff_#in~Alen;diff_~B.base, diff_~B.offset := diff_#in~B.base, diff_#in~B.offset;diff_~Blen := diff_#in~Blen;diff_~D.base, diff_~D.offset := diff_#in~D.base, diff_#in~D.offset;diff_~k~0 := 0;diff_~i~0 := 0;diff_~l1~0 := diff_~Alen;diff_~l2~0 := diff_~Blen;havoc diff_~found~0; 477#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 478#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 486#L558 assume diff_#t~mem2 == diff_#t~mem3;havoc diff_#t~mem2;havoc diff_#t~mem3;diff_~found~0 := 1; 484#L558-2 assume !(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0); 482#L557-2 assume !(0 == diff_~found~0); 474#L564-1 diff_#t~post7 := diff_~i~0;diff_~i~0 := 1 + diff_#t~post7;havoc diff_#t~post7; 475#L554-2 assume !!(diff_~i~0 < diff_~l1~0);diff_~j~0 := 0;diff_~found~0 := 0; 470#L558-2 [2019-01-14 02:32:49,215 INFO L796 eck$LassoCheckResult]: Loop: 470#L558-2 assume !!(diff_~j~0 < diff_~l2~0 && 0 == diff_~found~0);call diff_#t~mem2 := read~int(diff_~A.base, diff_~A.offset + 4 * diff_~i~0, 4);call diff_#t~mem3 := read~int(diff_~B.base, diff_~B.offset + 4 * diff_~j~0, 4); 469#L558 assume !(diff_#t~mem2 == diff_#t~mem3);havoc diff_#t~mem2;havoc diff_#t~mem3;diff_#t~post4 := diff_~j~0;diff_~j~0 := 1 + diff_#t~post4;havoc diff_#t~post4; 470#L558-2 [2019-01-14 02:32:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1813422420, now seen corresponding path program 2 times [2019-01-14 02:32:49,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:49,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:49,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:49,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 3 times [2019-01-14 02:32:49,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:49,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:49,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:49,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:49,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:49,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1057777617, now seen corresponding path program 1 times [2019-01-14 02:32:49,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:49,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:49,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:49,620 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 02:32:50,251 WARN L181 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 137 [2019-01-14 02:32:50,455 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-14 02:32:50,457 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:50,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:50,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:50,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:50,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:50,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:50,458 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:50,458 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:50,458 INFO L131 ssoRankerPreferences]: Filename of dumped script: diff-alloca_true-termination.c.i_Iteration7_Lasso [2019-01-14 02:32:50,458 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:50,458 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:50,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:50,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:50,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,011 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2019-01-14 02:32:51,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,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-01-14 02:32:51,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:51,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-01-14 02:32:51,441 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:32:52,777 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-14 02:32:52,960 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:32:53,044 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:53,044 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:53,044 INFO L122 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-01-14 02:32:53,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:53,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:53,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:53,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:53,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:53,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:53,053 INFO L122 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-01-14 02:32:53,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:53,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:53,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:53,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:53,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:53,060 INFO L122 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-01-14 02:32:53,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:53,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:53,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:53,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:53,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:53,067 INFO L122 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-01-14 02:32:53,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:53,069 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:53,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,073 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:32:53,073 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:53,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:53,091 INFO L122 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-01-14 02:32:53,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:53,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:53,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:53,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:53,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:53,102 INFO L122 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-01-14 02:32:53,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:53,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:53,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:53,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:53,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:53,111 INFO L122 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-01-14 02:32:53,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:53,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:53,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:53,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:53,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:53,120 INFO L122 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-01-14 02:32:53,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,124 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:32:53,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:53,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,134 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:32:53,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:53,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:53,174 INFO L122 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-01-14 02:32:53,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:53,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:53,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:53,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:53,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:53,184 INFO L122 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-01-14 02:32:53,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:53,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:53,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:53,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:53,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:53,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:53,250 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:53,303 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:32:53,303 INFO L444 ModelExtractionUtils]: 58 out of 64 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:32:53,305 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:53,305 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:53,306 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:53,307 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_diff_~l2~0, ULTIMATE.start_diff_~j~0) = 1*ULTIMATE.start_diff_~l2~0 - 1*ULTIMATE.start_diff_~j~0 Supporting invariants [] [2019-01-14 02:32:53,766 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2019-01-14 02:32:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:54,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:54,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:54,140 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-01-14 02:32:54,140 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:32:54,167 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2019-01-14 02:32:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:32:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-14 02:32:54,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:32:54,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:54,172 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:32:54,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:54,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:54,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:54,223 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:32:54,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:32:54,242 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2019-01-14 02:32:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:32:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-14 02:32:54,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:32:54,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:54,244 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:32:54,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:54,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:54,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:54,328 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:32:54,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:32:54,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 28 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 34 states and 49 transitions. Complement of second has 6 states. [2019-01-14 02:32:54,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:32:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-01-14 02:32:54,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:32:54,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:54,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 02:32:54,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:54,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-14 02:32:54,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:54,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2019-01-14 02:32:54,359 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:54,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2019-01-14 02:32:54,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:32:54,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:32:54,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:32:54,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:54,360 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:54,360 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:54,360 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:54,360 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:32:54,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:32:54,361 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:54,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:32:54,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:32:54 BoogieIcfgContainer [2019-01-14 02:32:54,368 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:32:54,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:32:54,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:32:54,369 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:32:54,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:37" (3/4) ... [2019-01-14 02:32:54,373 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:32:54,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:32:54,374 INFO L168 Benchmark]: Toolchain (without parser) took 17929.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 186.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:54,375 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:54,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:54,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.09 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-01-14 02:32:54,377 INFO L168 Benchmark]: Boogie Preprocessor took 32.20 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-01-14 02:32:54,378 INFO L168 Benchmark]: RCFGBuilder took 459.87 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:54,379 INFO L168 Benchmark]: BuchiAutomizer took 16701.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.2 MB). Peak memory consumption was 193.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:54,380 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:54,388 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 666.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.09 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. * Boogie Preprocessor took 32.20 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 459.87 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16701.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.2 MB). Peak memory consumption was 193.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.4 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * A + unknown-#length-unknown[A] and consists of 4 locations. One deterministic module has affine ranking function -1 * B + unknown-#length-unknown[B] + -4 * j and consists of 4 locations. One nondeterministic module has affine ranking function l2 + -1 * j and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 15.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 126 SDtfs, 126 SDslu, 57 SDs, 0 SdLazy, 77 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital273 mio100 ax106 hnf99 lsp84 ukn88 mio100 lsp48 div100 bol100 ite100 ukn100 eq185 hnf89 smp100 dnf382 smp95 tf100 neg95 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 103ms VariablesStem: 13 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...