./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/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 32bit --witnessprinter.graph.data.programhash f2969d4725852fd68e7759cdb7f1d1929ca0124c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:53:42,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:53:42,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:53:42,186 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:53:42,186 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:53:42,187 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:53:42,188 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:53:42,189 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:53:42,190 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:53:42,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:53:42,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:53:42,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:53:42,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:53:42,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:53:42,193 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:53:42,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:53:42,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:53:42,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:53:42,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:53:42,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:53:42,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:53:42,200 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:53:42,201 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:53:42,201 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:53:42,201 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:53:42,202 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:53:42,203 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:53:42,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:53:42,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:53:42,205 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:53:42,205 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:53:42,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:53:42,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:53:42,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:53:42,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:53:42,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:53:42,207 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:53:42,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:53:42,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:53:42,219 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:53:42,219 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:53:42,219 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:53:42,219 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:53:42,219 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:53:42,219 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:53:42,220 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:53:42,220 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:53:42,220 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:53:42,220 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:53:42,220 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:53:42,220 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:53:42,221 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:53:42,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:53:42,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:53:42,222 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:53:42,222 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:53:42,222 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:53:42,222 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:53:42,222 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:53:42,223 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_3a23bff2-1980-4064-b265-7c2fbd921be0/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2969d4725852fd68e7759cdb7f1d1929ca0124c [2018-11-10 11:53:42,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:53:42,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:53:42,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:53:42,254 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:53:42,254 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:53:42,255 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 11:53:42,291 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/data/8814e3864/e5c000e622d74deab75536c630fc2b79/FLAG79c534af7 [2018-11-10 11:53:42,706 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:53:42,706 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 11:53:42,712 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/data/8814e3864/e5c000e622d74deab75536c630fc2b79/FLAG79c534af7 [2018-11-10 11:53:42,720 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/data/8814e3864/e5c000e622d74deab75536c630fc2b79 [2018-11-10 11:53:42,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:53:42,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:53:42,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:53:42,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:53:42,726 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:53:42,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:42,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b11911a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42, skipping insertion in model container [2018-11-10 11:53:42,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:42,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:53:42,757 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:53:42,872 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:53:42,876 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:53:42,899 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:53:42,908 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:53:42,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42 WrapperNode [2018-11-10 11:53:42,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:53:42,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:53:42,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:53:42,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:53:42,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:42,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:42,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:53:42,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:53:42,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:53:42,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:53:42,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:42,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:42,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:42,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:42,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:43,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:43,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... [2018-11-10 11:53:43,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:53:43,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:53:43,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:53:43,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:53:43,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/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-10 11:53:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:53:43,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:53:43,364 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:53:43,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:53:43 BoogieIcfgContainer [2018-11-10 11:53:43,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:53:43,365 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:53:43,365 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:53:43,368 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:53:43,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:53:43,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:53:42" (1/3) ... [2018-11-10 11:53:43,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@507e3c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:53:43, skipping insertion in model container [2018-11-10 11:53:43,370 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:53:43,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:42" (2/3) ... [2018-11-10 11:53:43,371 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@507e3c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:53:43, skipping insertion in model container [2018-11-10 11:53:43,371 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:53:43,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:53:43" (3/3) ... [2018-11-10 11:53:43,372 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 11:53:43,418 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:53:43,419 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:53:43,419 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:53:43,419 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:53:43,419 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:53:43,419 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:53:43,419 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:53:43,419 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:53:43,419 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:53:43,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2018-11-10 11:53:43,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-11-10 11:53:43,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:43,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:43,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:53:43,461 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:43,461 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:53:43,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2018-11-10 11:53:43,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-11-10 11:53:43,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:43,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:43,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:53:43,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:43,472 INFO L793 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~alive1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive3~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 51#L202true assume !(~r1~0 == 0);init_~tmp~0 := 0; 30#L202-1true init_#res := init_~tmp~0; 24#L271true main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 26#L326-3true [2018-11-10 11:53:43,473 INFO L795 eck$LassoCheckResult]: Loop: 26#L326-3true assume true; 39#L326-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 5#L102true assume !(~mode1~0 % 256 != 0); 19#L120true assume !(~alive1~0 % 256 != 0); 15#L120-2true ~mode1~0 := 1; 23#L102-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 64#L134true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 50#L137true assume !(node2_~m2~0 != ~nomsg~0); 48#L137-1true ~mode2~0 := 0; 76#L134-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 8#L168true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 14#L171true assume !(node3_~m3~0 != ~nomsg~0); 13#L171-1true ~mode3~0 := 0; 6#L168-2true assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 56#L279true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 54#L279-1true check_#res := check_~tmp~1; 74#L291true main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 67#L350true assume !(assert_~arg % 256 == 0); 43#L345true assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 26#L326-3true [2018-11-10 11:53:43,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 28791078, now seen corresponding path program 1 times [2018-11-10 11:53:43,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:43,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:43,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:43,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:43,605 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-10 11:53:43,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:43,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:53:43,609 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:53:43,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1943322965, now seen corresponding path program 1 times [2018-11-10 11:53:43,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:43,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:43,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:43,677 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-10 11:53:43,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:43,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:53:43,679 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:53:43,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:53:43,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:53:43,689 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2018-11-10 11:53:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:43,732 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2018-11-10 11:53:43,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:53:43,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 120 transitions. [2018-11-10 11:53:43,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 11:53:43,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 69 states and 97 transitions. [2018-11-10 11:53:43,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 11:53:43,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 11:53:43,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 97 transitions. [2018-11-10 11:53:43,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:43,741 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 97 transitions. [2018-11-10 11:53:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 97 transitions. [2018-11-10 11:53:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-10 11:53:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 11:53:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2018-11-10 11:53:43,761 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 97 transitions. [2018-11-10 11:53:43,761 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 97 transitions. [2018-11-10 11:53:43,761 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:53:43,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 97 transitions. [2018-11-10 11:53:43,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 11:53:43,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:43,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:43,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:43,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:43,764 INFO L793 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~alive1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive3~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 182#L202 assume ~r1~0 == 0; 222#L203 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 189#L204 assume ~id1~0 >= 0; 190#L205 assume ~st1~0 == 0; 210#L206 assume ~send1~0 == ~id1~0; 229#L207 assume ~mode1~0 % 256 == 0; 167#L208 assume ~id2~0 >= 0; 168#L209 assume ~st2~0 == 0; 204#L210 assume ~send2~0 == ~id2~0; 220#L211 assume ~mode2~0 % 256 == 0; 179#L212 assume ~id3~0 >= 0; 180#L213 assume ~st3~0 == 0; 223#L214 assume ~send3~0 == ~id3~0; 191#L215 assume ~mode3~0 % 256 == 0; 192#L216 assume ~id1~0 != ~id2~0; 212#L217 assume ~id1~0 != ~id3~0; 230#L218 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 205#L202-1 init_#res := init_~tmp~0; 197#L271 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 198#L326-3 [2018-11-10 11:53:43,764 INFO L795 eck$LassoCheckResult]: Loop: 198#L326-3 assume true; 203#L326-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 171#L102 assume !(~mode1~0 % 256 != 0); 172#L120 assume !(~alive1~0 % 256 != 0); 188#L120-2 ~mode1~0 := 1; 178#L102-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 196#L134 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 221#L137 assume !(node2_~m2~0 != ~nomsg~0); 184#L137-1 ~mode2~0 := 0; 211#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 174#L168 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 175#L171 assume !(node3_~m3~0 != ~nomsg~0); 186#L171-1 ~mode3~0 := 0; 169#L168-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 170#L279 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 217#L279-1 check_#res := check_~tmp~1; 225#L291 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 232#L350 assume !(assert_~arg % 256 == 0); 214#L345 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 198#L326-3 [2018-11-10 11:53:43,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 1 times [2018-11-10 11:53:43,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:43,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:43,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:43,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1943322965, now seen corresponding path program 2 times [2018-11-10 11:53:43,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:43,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:43,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:43,858 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-10 11:53:43,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:43,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:53:43,858 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:53:43,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:53:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:53:43,859 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. cyclomatic complexity: 29 Second operand 5 states. [2018-11-10 11:53:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:43,901 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2018-11-10 11:53:43,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:53:43,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 99 transitions. [2018-11-10 11:53:43,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 11:53:43,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 69 states and 95 transitions. [2018-11-10 11:53:43,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 11:53:43,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 11:53:43,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 95 transitions. [2018-11-10 11:53:43,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:43,905 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 95 transitions. [2018-11-10 11:53:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 95 transitions. [2018-11-10 11:53:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-10 11:53:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 11:53:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2018-11-10 11:53:43,908 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 95 transitions. [2018-11-10 11:53:43,909 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 95 transitions. [2018-11-10 11:53:43,909 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:53:43,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 95 transitions. [2018-11-10 11:53:43,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 11:53:43,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:43,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:43,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:43,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:43,911 INFO L793 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 334#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21, main_#t~ret22, main_#t~post23, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~alive1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive3~0 := main_#t~nondet20;havoc main_#t~nondet20;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 335#L202 assume ~r1~0 == 0; 375#L203 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 342#L204 assume ~id1~0 >= 0; 343#L205 assume ~st1~0 == 0; 363#L206 assume ~send1~0 == ~id1~0; 382#L207 assume ~mode1~0 % 256 == 0; 320#L208 assume ~id2~0 >= 0; 321#L209 assume ~st2~0 == 0; 357#L210 assume ~send2~0 == ~id2~0; 373#L211 assume ~mode2~0 % 256 == 0; 332#L212 assume ~id3~0 >= 0; 333#L213 assume ~st3~0 == 0; 376#L214 assume ~send3~0 == ~id3~0; 344#L215 assume ~mode3~0 % 256 == 0; 345#L216 assume ~id1~0 != ~id2~0; 364#L217 assume ~id1~0 != ~id3~0; 383#L218 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 358#L202-1 init_#res := init_~tmp~0; 350#L271 main_#t~ret21 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret21;havoc main_#t~ret21;assume main_~i2~0 != 0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 351#L326-3 [2018-11-10 11:53:43,911 INFO L795 eck$LassoCheckResult]: Loop: 351#L326-3 assume true; 355#L326-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 322#L102 assume !(~mode1~0 % 256 != 0); 323#L120 assume !(~alive1~0 % 256 != 0); 341#L120-2 ~mode1~0 := 1; 331#L102-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 349#L134 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 374#L137 assume !(node2_~m2~0 != ~nomsg~0); 337#L137-1 ~mode2~0 := 0; 365#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 327#L168 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 328#L171 assume !(node3_~m3~0 != ~nomsg~0); 339#L171-1 ~mode3~0 := 0; 325#L168-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 326#L279 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 381#L280 assume ~r1~0 < 3;check_~tmp~1 := 1; 370#L279-1 check_#res := check_~tmp~1; 378#L291 main_#t~ret22 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret22;havoc main_#t~ret22;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 385#L350 assume !(assert_~arg % 256 == 0); 367#L345 assume { :end_inline_assert } true;main_#t~post23 := main_~i2~0;main_~i2~0 := main_#t~post23 + 1;havoc main_#t~post23; 351#L326-3 [2018-11-10 11:53:43,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:43,911 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 2 times [2018-11-10 11:53:43,911 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:43,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:43,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:53:43,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:43,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:43,939 INFO L82 PathProgramCache]: Analyzing trace with hash -496797049, now seen corresponding path program 1 times [2018-11-10 11:53:43,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:43,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:53:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:43,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 391073378, now seen corresponding path program 1 times [2018-11-10 11:53:43,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:43,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:44,002 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-10 11:53:44,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:44,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:53:44,144 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2018-11-10 11:53:44,301 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2018-11-10 11:53:44,309 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:53:44,310 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:53:44,310 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:53:44,310 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:53:44,310 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:53:44,310 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:44,310 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:53:44,310 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:53:44,310 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-11-10 11:53:44,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:53:44,311 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:53:44,325 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-10 11:53:44,337 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-10 11:53:44,341 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-10 11:53:44,343 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-10 11:53:44,345 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-10 11:53:44,346 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-10 11:53:44,350 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-10 11:53:44,351 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-10 11:53:44,354 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-10 11:53:44,356 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-10 11:53:44,359 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-10 11:53:44,361 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-10 11:53:44,362 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-10 11:53:44,363 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-10 11:53:44,365 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-10 11:53:44,367 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-10 11:53:44,368 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-10 11:53:44,371 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-10 11:53:44,384 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-10 11:53:44,391 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-10 11:53:44,393 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-10 11:53:44,396 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-10 11:53:44,405 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-10 11:53:44,652 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:53:44,652 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:44,657 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:44,657 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a23bff2-1980-4064-b265-7c2fbd921be0/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:44,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:53:44,678 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:44,848 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:53:44,849 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:53:44,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:53:44,849 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:53:44,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:53:44,849 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:53:44,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:44,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:53:44,849 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:53:44,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2018-11-10 11:53:44,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:53:44,850 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:53:44,851 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-10 11:53:44,855 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-10 11:53:44,858 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-10 11:53:44,859 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-10 11:53:44,860 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-10 11:53:44,861 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-10 11:53:44,863 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-10 11:53:44,864 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-10 11:53:44,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-10 11:53:44,866 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-10 11:53:44,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-10 11:53:44,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-10 11:53:44,873 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-10 11:53:44,874 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-10 11:53:44,875 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-10 11:53:44,877 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-10 11:53:44,878 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-10 11:53:44,882 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-10 11:53:44,884 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-10 11:53:44,885 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-10 11:53:44,887 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-10 11:53:44,888 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-10 11:53:44,890 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-10 11:53:45,143 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:53:45,146 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:53:45,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-10 11:53:45,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,153 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,154 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-10 11:53:45,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,157 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-10 11:53:45,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:45,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:53:45,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,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-10 11:53:45,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,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-10 11:53:45,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,166 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-10 11:53:45,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:45,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:53:45,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:53:45,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,172 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-10 11:53:45,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,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-10 11:53:45,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:45,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:53:45,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,180 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-10 11:53:45,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,182 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-10 11:53:45,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,185 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-10 11:53:45,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,190 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-10 11:53:45,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:45,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:53:45,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,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-10 11:53:45,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,196 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-10 11:53:45,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,198 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-10 11:53:45,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,201 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-10 11:53:45,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,204 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:45,204 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-10 11:53:45,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:45,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:45,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:45,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:45,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:45,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:45,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:45,207 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:53:45,210 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:53:45,210 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 11:53:45,212 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:53:45,212 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:53:45,212 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:53:45,212 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-10 11:53:45,213 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 11:53:45,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:45,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:53:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:45,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:53:45,271 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-10 11:53:45,273 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 11:53:45,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 95 transitions. cyclomatic complexity: 27 Second operand 4 states. [2018-11-10 11:53:45,307 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 95 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 117 states and 170 transitions. Complement of second has 6 states. [2018-11-10 11:53:45,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:53:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 11:53:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-10 11:53:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 21 letters. Loop has 20 letters. [2018-11-10 11:53:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:53:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 41 letters. Loop has 20 letters. [2018-11-10 11:53:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:53:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 21 letters. Loop has 40 letters. [2018-11-10 11:53:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:53:45,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 170 transitions. [2018-11-10 11:53:45,312 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:53:45,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2018-11-10 11:53:45,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:53:45,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:53:45,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:53:45,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:45,313 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:53:45,313 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:53:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:53:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:53:45,313 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 11:53:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:45,314 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 11:53:45,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 11:53:45,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 11:53:45,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:53:45,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:53:45,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:53:45,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:53:45,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:53:45,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:45,314 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:53:45,314 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:53:45,314 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:53:45,315 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:53:45,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:53:45,315 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:53:45,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:53:45,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:53:45 BoogieIcfgContainer [2018-11-10 11:53:45,320 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:53:45,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:53:45,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:53:45,320 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:53:45,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:53:43" (3/4) ... [2018-11-10 11:53:45,323 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:53:45,323 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:53:45,323 INFO L168 Benchmark]: Toolchain (without parser) took 2600.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 957.5 MB in the beginning and 982.6 MB in the end (delta: -25.1 MB). Peak memory consumption was 95.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:45,324 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:53:45,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.89 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 941.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:45,325 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:45,325 INFO L168 Benchmark]: Boogie Preprocessor took 22.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:53:45,325 INFO L168 Benchmark]: RCFGBuilder took 360.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:45,326 INFO L168 Benchmark]: BuchiAutomizer took 1954.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.6 MB in the end (delta: 99.5 MB). Peak memory consumption was 99.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:45,326 INFO L168 Benchmark]: Witness Printer took 2.93 ms. Allocated memory is still 1.1 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:53:45,328 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.89 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 941.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 360.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1954.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.6 MB in the end (delta: 99.5 MB). Peak memory consumption was 99.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.93 ms. Allocated memory is still 1.1 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 69 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 306 SDtfs, 96 SDslu, 567 SDs, 0 SdLazy, 22 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax136 hnf108 lsp23 ukn100 mio100 lsp100 div142 bol100 ite100 ukn100 eq158 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...