./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer --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 e9d8db831e66fcf4f47c300fcbd3a74f1185238a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:44:47,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:44:47,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:44:47,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:44:47,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:44:47,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:44:47,520 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:44:47,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:44:47,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:44:47,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:44:47,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:44:47,525 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:44:47,526 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:44:47,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:44:47,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:44:47,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:44:47,530 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:44:47,531 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:44:47,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:44:47,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:44:47,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:44:47,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:44:47,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:44:47,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:44:47,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:44:47,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:44:47,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:44:47,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:44:47,541 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:44:47,542 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:44:47,542 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:44:47,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:44:47,543 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:44:47,543 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:44:47,544 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:44:47,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:44:47,545 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:44:47,557 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:44:47,557 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:44:47,558 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:44:47,558 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:44:47,558 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:44:47,559 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:44:47,559 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:44:47,559 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:44:47,559 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:44:47,559 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:44:47,559 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:44:47,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:44:47,560 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:44:47,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:44:47,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:44:47,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:44:47,560 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:44:47,560 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:44:47,560 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:44:47,561 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:44:47,561 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:44:47,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:44:47,561 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:44:47,561 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:44:47,561 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:44:47,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:44:47,562 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:44:47,562 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:44:47,563 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:44:47,563 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer 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 -> e9d8db831e66fcf4f47c300fcbd3a74f1185238a [2018-11-23 06:44:47,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:44:47,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:44:47,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:44:47,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:44:47,605 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:44:47,606 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2018-11-23 06:44:47,649 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/data/89ce752d3/eb319f1b9c0c43ba867dcf0b598a35cb/FLAG073ff401a [2018-11-23 06:44:48,079 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:44:48,079 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2018-11-23 06:44:48,085 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/data/89ce752d3/eb319f1b9c0c43ba867dcf0b598a35cb/FLAG073ff401a [2018-11-23 06:44:48,095 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/data/89ce752d3/eb319f1b9c0c43ba867dcf0b598a35cb [2018-11-23 06:44:48,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:44:48,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:44:48,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:44:48,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:44:48,101 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:44:48,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4071ea38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48, skipping insertion in model container [2018-11-23 06:44:48,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:44:48,141 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:44:48,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:44:48,367 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:44:48,446 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:44:48,468 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:44:48,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48 WrapperNode [2018-11-23 06:44:48,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:44:48,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:44:48,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:44:48,470 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:44:48,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:44:48,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:44:48,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:44:48,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:44:48,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... [2018-11-23 06:44:48,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:44:48,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:44:48,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:44:48,523 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:44:48,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/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 [2018-11-23 06:44:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:44:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:44:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:44:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:44:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:44:48,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:44:48,709 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:44:48,709 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 06:44:48,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:44:48 BoogieIcfgContainer [2018-11-23 06:44:48,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:44:48,710 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:44:48,710 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:44:48,712 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:44:48,713 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:44:48,713 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:44:48" (1/3) ... [2018-11-23 06:44:48,714 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26732a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:44:48, skipping insertion in model container [2018-11-23 06:44:48,714 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:44:48,714 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:44:48" (2/3) ... [2018-11-23 06:44:48,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26732a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:44:48, skipping insertion in model container [2018-11-23 06:44:48,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:44:48,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:44:48" (3/3) ... [2018-11-23 06:44:48,716 INFO L375 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2018-11-23 06:44:48,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:44:48,759 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:44:48,759 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:44:48,759 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:44:48,759 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:44:48,759 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:44:48,759 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:44:48,759 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:44:48,759 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:44:48,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 06:44:48,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:44:48,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:44:48,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:44:48,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:44:48,796 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:44:48,796 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:44:48,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 06:44:48,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:44:48,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:44:48,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:44:48,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:44:48,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:44:48,806 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 10#L558-2true [2018-11-23 06:44:48,806 INFO L796 eck$LassoCheckResult]: Loop: 10#L558-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 8#L552-1true assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L553true assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 9#L553-2true call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 5#L558true assume 0 != main_#t~mem10;havoc main_#t~mem10;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 10#L558-2true [2018-11-23 06:44:48,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 06:44:48,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:48,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:48,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:48,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:48,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:48,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash 35468238, now seen corresponding path program 1 times [2018-11-23 06:44:48,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:48,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:48,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:48,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:48,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:48,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907724, now seen corresponding path program 1 times [2018-11-23 06:44:48,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:48,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:48,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:48,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:48,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:44:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:44:49,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:44:49,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:44:49,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:44:49,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:44:49,216 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 5 states. [2018-11-23 06:44:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:44:49,252 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-23 06:44:49,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:44:49,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-23 06:44:49,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:44:49,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2018-11-23 06:44:49,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 06:44:49,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 06:44:49,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-23 06:44:49,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:44:49,260 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 06:44:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-23 06:44:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 06:44:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 06:44:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-23 06:44:49,280 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 06:44:49,280 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 06:44:49,281 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:44:49,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-23 06:44:49,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:44:49,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:44:49,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:44:49,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:44:49,282 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:44:49,282 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 37#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 38#L558-2 [2018-11-23 06:44:49,282 INFO L796 eck$LassoCheckResult]: Loop: 38#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 43#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 39#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 40#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 41#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 38#L558-2 [2018-11-23 06:44:49,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 06:44:49,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:49,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:49,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:49,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:49,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 35468240, now seen corresponding path program 1 times [2018-11-23 06:44:49,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:49,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:49,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:44:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:49,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907726, now seen corresponding path program 1 times [2018-11-23 06:44:49,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:49,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:49,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:49,581 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-11-23 06:44:49,642 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:44:49,643 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:44:49,643 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:44:49,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:44:49,644 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:44:49,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:44:49,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:44:49,644 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:44:49,644 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 06:44:49,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:44:49,645 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:44:49,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:49,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:50,129 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:44:50,132 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:44:50,134 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 [2018-11-23 06:44:50,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:44:50,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:44:50,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:44:50,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,140 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 [2018-11-23 06:44:50,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:44:50,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:44:50,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:44:50,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,142 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 [2018-11-23 06:44:50,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:44:50,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:44:50,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:44:50,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,145 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 [2018-11-23 06:44:50,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:44:50,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:44:50,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:44:50,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,147 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 [2018-11-23 06:44:50,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:44:50,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:44:50,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:44:50,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,150 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 [2018-11-23 06:44:50,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,155 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 [2018-11-23 06:44:50,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,161 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 [2018-11-23 06:44:50,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:44:50,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:44:50,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:44:50,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,164 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 [2018-11-23 06:44:50,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,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 [2018-11-23 06:44:50,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:44:50,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:44:50,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:44:50,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,179 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 [2018-11-23 06:44:50,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,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 [2018-11-23 06:44:50,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,185 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:44:50,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,187 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:44:50,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,194 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 [2018-11-23 06:44:50,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,207 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 [2018-11-23 06:44:50,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,227 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 [2018-11-23 06:44:50,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:44:50,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,231 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:44:50,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,237 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 [2018-11-23 06:44:50,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,250 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 [2018-11-23 06:44:50,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,256 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 [2018-11-23 06:44:50,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:50,260 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 [2018-11-23 06:44:50,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:50,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:50,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:50,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:50,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:50,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:50,273 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:44:50,278 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:44:50,279 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 06:44:50,281 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:44:50,283 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:44:50,283 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:44:50,283 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 255 Supporting invariants [] [2018-11-23 06:44:50,329 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 06:44:50,333 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:44:50,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:44:50,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:44:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:44:50,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:44:50,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:44:50,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-23 06:44:50,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:44:50,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-23 06:44:50,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:44:50,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:44:50,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:44:50,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:17 [2018-11-23 06:44:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:44:50,451 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 06:44:50,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-23 06:44:50,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 18 states and 21 transitions. Complement of second has 9 states. [2018-11-23 06:44:50,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 06:44:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 06:44:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-11-23 06:44:50,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-23 06:44:50,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:44:50,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-23 06:44:50,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:44:50,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-23 06:44:50,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:44:50,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-23 06:44:50,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:44:50,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-23 06:44:50,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 06:44:50,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 06:44:50,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-23 06:44:50,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:44:50,495 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 06:44:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-23 06:44:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 06:44:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 06:44:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 06:44:50,498 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 06:44:50,498 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 06:44:50,498 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:44:50,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-23 06:44:50,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:44:50,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:44:50,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:44:50,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:44:50,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:44:50,499 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 156#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 157#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 167#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 158#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; 159#L553-2 [2018-11-23 06:44:50,500 INFO L796 eck$LassoCheckResult]: Loop: 159#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 169#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 172#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 171#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 170#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 159#L553-2 [2018-11-23 06:44:50,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-11-23 06:44:50,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:50,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:50,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:50,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:50,520 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 2 times [2018-11-23 06:44:50,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:50,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:50,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:50,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:50,533 INFO L82 PathProgramCache]: Analyzing trace with hash 705693312, now seen corresponding path program 1 times [2018-11-23 06:44:50,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:50,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:50,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:50,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:44:50,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:50,812 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-11-23 06:44:50,985 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-11-23 06:44:50,987 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:44:50,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:44:50,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:44:50,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:44:50,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:44:50,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:44:50,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:44:50,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:44:50,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 06:44:50,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:44:50,988 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:44:50,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:50,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:50,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:44:51,387 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:44:51,388 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:44:51,388 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 [2018-11-23 06:44:51,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:51,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:44:51,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:51,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:51,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:51,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:44:51,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:44:51,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:51,391 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 [2018-11-23 06:44:51,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:51,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:44:51,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:51,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:51,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:51,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:44:51,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:44:51,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:51,392 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 [2018-11-23 06:44:51,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:51,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:51,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:51,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:51,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:51,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:51,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:51,402 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 [2018-11-23 06:44:51,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:51,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:51,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:51,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:51,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:51,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:51,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:51,407 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 [2018-11-23 06:44:51,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:51,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:51,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:51,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:51,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:51,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:51,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:51,413 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 [2018-11-23 06:44:51,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:51,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:51,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:51,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:51,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:51,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:51,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:51,417 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 [2018-11-23 06:44:51,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:51,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:51,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:51,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:51,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:51,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:51,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:44:51,420 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 [2018-11-23 06:44:51,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:44:51,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:44:51,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:44:51,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:44:51,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:44:51,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:44:51,432 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:44:51,437 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:44:51,437 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:44:51,438 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:44:51,439 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:44:51,439 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:44:51,439 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 255 Supporting invariants [] [2018-11-23 06:44:51,465 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 06:44:51,466 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 06:44:51,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:44:51,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:44:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:44:51,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:44:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:44:51,522 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 06:44:51,522 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-23 06:44:51,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 27 states and 32 transitions. Complement of second has 9 states. [2018-11-23 06:44:51,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 06:44:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 06:44:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-23 06:44:51,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-23 06:44:51,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:44:51,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-23 06:44:51,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:44:51,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-23 06:44:51,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:44:51,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-23 06:44:51,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:44:51,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 06:44:51,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 06:44:51,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 06:44:51,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-23 06:44:51,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:44:51,551 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 06:44:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-23 06:44:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 06:44:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 06:44:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 06:44:51,555 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 06:44:51,555 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 06:44:51,555 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:44:51,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-23 06:44:51,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:44:51,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:44:51,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:44:51,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2018-11-23 06:44:51,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:44:51,557 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 302#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 303#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 320#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 321#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; 319#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 318#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 324#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 322#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 304#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~post8;havoc main_#t~mem7; 305#L553-2 [2018-11-23 06:44:51,557 INFO L796 eck$LassoCheckResult]: Loop: 305#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 308#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 309#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 313#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 314#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 305#L553-2 [2018-11-23 06:44:51,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:51,557 INFO L82 PathProgramCache]: Analyzing trace with hash 705693310, now seen corresponding path program 1 times [2018-11-23 06:44:51,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:51,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:51,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:51,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:51,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:44:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:44:51,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:44:51,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98993677-6e95-483f-96f2-4ae4e4e6530f/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:44:51,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:44:51,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:44:51,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:44:51,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-23 06:44:51,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:44:51,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-11-23 06:44:51,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:44:51,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:44:51,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:44:51,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-11-23 06:44:51,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:44:51,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 06:44:51,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:44:51,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:44:51,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:44:51,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:124, output treesize:12 [2018-11-23 06:44:51,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 06:44:51,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-11-23 06:44:51,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:44:51,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:44:51,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:44:51,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:11 [2018-11-23 06:44:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:44:51,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:44:51,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-23 06:44:51,829 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:44:51,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:44:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 3 times [2018-11-23 06:44:51,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:44:51,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:44:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:51,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:44:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:44:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:44:51,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 06:44:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 06:44:51,933 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-23 06:44:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:44:51,980 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 06:44:51,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:44:51,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-23 06:44:51,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:44:51,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-23 06:44:51,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:44:51,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:44:51,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:44:51,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:44:51,982 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:44:51,982 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:44:51,982 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:44:51,982 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:44:51,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:44:51,983 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:44:51,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:44:51,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:44:51 BoogieIcfgContainer [2018-11-23 06:44:51,989 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:44:51,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:44:51,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:44:51,990 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:44:51,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:44:48" (3/4) ... [2018-11-23 06:44:51,993 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:44:51,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:44:51,995 INFO L168 Benchmark]: Toolchain (without parser) took 3897.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.1 MB). Free memory was 957.5 MB in the beginning and 955.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 230.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:44:51,995 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:44:51,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:44:51,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.99 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:44:51,996 INFO L168 Benchmark]: Boogie Preprocessor took 21.81 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. [2018-11-23 06:44:51,997 INFO L168 Benchmark]: RCFGBuilder took 187.23 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.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:44:51,997 INFO L168 Benchmark]: BuchiAutomizer took 3279.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 148.3 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:44:51,998 INFO L168 Benchmark]: Witness Printer took 3.51 ms. Allocated memory is still 1.3 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:44:52,000 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.99 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.81 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 187.23 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.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3279.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 148.3 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.51 ms. Allocated memory is still 1.3 GB. Free memory is still 955.0 MB. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 21 SDslu, 21 SDs, 0 SdLazy, 73 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital241 mio100 ax107 hnf100 lsp89 ukn58 mio100 lsp38 div169 bol100 ite100 ukn100 eq151 hnf70 smp93 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...