./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_true-unreach-call.ufo.BOUNDED-10.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_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/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 42c65bbe9265dd26dc791a1c83f008139e8490c7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 12:11:35,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:11:35,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:11:35,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:11:35,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:11:35,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:11:35,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:11:35,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:11:35,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:11:35,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:11:35,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:11:35,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:11:35,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:11:35,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:11:35,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:11:35,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:11:35,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:11:35,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:11:35,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:11:35,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:11:35,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:11:35,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:11:35,399 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:11:35,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:11:35,400 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:11:35,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:11:35,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:11:35,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:11:35,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:11:35,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:11:35,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:11:35,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:11:35,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:11:35,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:11:35,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:11:35,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:11:35,405 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:11:35,415 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:11:35,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:11:35,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:11:35,417 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:11:35,417 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:11:35,417 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:11:35,417 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:11:35,417 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:11:35,417 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:11:35,417 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:11:35,418 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:11:35,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:11:35,418 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:11:35,418 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:11:35,418 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:11:35,418 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:11:35,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:11:35,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:11:35,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:11:35,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:11:35,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:11:35,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:11:35,419 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:11:35,419 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:11:35,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:11:35,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:11:35,420 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:11:35,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:11:35,420 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:11:35,420 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:11:35,421 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:11:35,421 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_a9946ada-6d52-4868-895d-44a27c1021f2/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 -> 42c65bbe9265dd26dc791a1c83f008139e8490c7 [2018-11-10 12:11:35,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:11:35,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:11:35,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:11:35,461 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:11:35,461 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:11:35,462 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 12:11:35,513 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/data/7beab41d0/e52e06e7cb354f80a61312febe4740d3/FLAGbbb5c750c [2018-11-10 12:11:35,880 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:11:35,881 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 12:11:35,889 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/data/7beab41d0/e52e06e7cb354f80a61312febe4740d3/FLAGbbb5c750c [2018-11-10 12:11:35,902 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/bin-2019/uautomizer/data/7beab41d0/e52e06e7cb354f80a61312febe4740d3 [2018-11-10 12:11:35,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:11:35,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:11:35,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:11:35,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:11:35,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:11:35,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:11:35" (1/1) ... [2018-11-10 12:11:35,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bcb58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:35, skipping insertion in model container [2018-11-10 12:11:35,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:11:35" (1/1) ... [2018-11-10 12:11:35,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:11:35,954 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:11:36,119 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:11:36,125 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:11:36,159 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:11:36,174 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:11:36,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36 WrapperNode [2018-11-10 12:11:36,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:11:36,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:11:36,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:11:36,175 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:11:36,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... [2018-11-10 12:11:36,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... [2018-11-10 12:11:36,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:11:36,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:11:36,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:11:36,255 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:11:36,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... [2018-11-10 12:11:36,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... [2018-11-10 12:11:36,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... [2018-11-10 12:11:36,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... [2018-11-10 12:11:36,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... [2018-11-10 12:11:36,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... [2018-11-10 12:11:36,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... [2018-11-10 12:11:36,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:11:36,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:11:36,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:11:36,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:11:36,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/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 12:11:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:11:36,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:11:36,775 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:11:36,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:11:36 BoogieIcfgContainer [2018-11-10 12:11:36,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:11:36,776 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:11:36,776 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:11:36,778 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:11:36,779 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:11:36,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:11:35" (1/3) ... [2018-11-10 12:11:36,779 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28585639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:11:36, skipping insertion in model container [2018-11-10 12:11:36,780 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:11:36,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:36" (2/3) ... [2018-11-10 12:11:36,780 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28585639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:11:36, skipping insertion in model container [2018-11-10 12:11:36,780 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:11:36,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:11:36" (3/3) ... [2018-11-10 12:11:36,781 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 12:11:36,819 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:11:36,819 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:11:36,820 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:11:36,820 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:11:36,820 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:11:36,820 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:11:36,820 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:11:36,820 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:11:36,820 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:11:36,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states. [2018-11-10 12:11:36,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 12:11:36,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:11:36,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:11:36,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:11:36,861 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:11:36,861 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:11:36,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states. [2018-11-10 12:11:36,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 12:11:36,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:11:36,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:11:36,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:11:36,866 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:11:36,872 INFO L793 eck$LassoCheckResult]: Stem: 92#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 47#L290true assume !(~r1~0 == 0);init_~tmp~0 := 0; 45#L290-1true init_#res := init_~tmp~0; 54#L419true main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 49#L488-3true [2018-11-10 12:11:36,873 INFO L795 eck$LassoCheckResult]: Loop: 49#L488-3true assume true; 46#L488-1true assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 104#L118true assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 35#L122true assume !(node1_~m1~0 != ~nomsg~0); 50#L122-1true ~mode1~0 := 0; 90#L118-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 19#L153true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 114#L156true assume !(node2_~m2~0 != ~nomsg~0); 113#L156-1true ~mode2~0 := 0; 17#L153-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 84#L187true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 72#L190true assume !(node3_~m3~0 != ~nomsg~0); 70#L190-1true ~mode3~0 := 0; 95#L187-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 40#L221true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 44#L224true assume !(node4_~m4~0 != ~nomsg~0); 43#L224-1true ~mode4~0 := 0; 36#L221-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 13#L255true assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 120#L258true assume !(node5_~m5~0 != ~nomsg~0); 119#L258-1true ~mode5~0 := 0; 115#L255-2true assume { :end_inline_node5 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 71#L427true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 73#L427-1true check_#res := check_~tmp~1; 22#L439true main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 65#L518true assume !(assert_~arg % 256 == 0); 39#L513true assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 49#L488-3true [2018-11-10 12:11:36,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash 28880448, now seen corresponding path program 1 times [2018-11-10 12:11:36,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:36,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:36,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:36,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:36,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:37,020 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 12:11:37,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:11:37,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:11:37,025 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:11:37,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash 199422581, now seen corresponding path program 1 times [2018-11-10 12:11:37,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:37,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:37,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:37,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:37,122 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 12:11:37,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:11:37,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:11:37,124 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:11:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:11:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:11:37,136 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 4 states. [2018-11-10 12:11:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:11:37,190 INFO L93 Difference]: Finished difference Result 122 states and 201 transitions. [2018-11-10 12:11:37,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:11:37,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 201 transitions. [2018-11-10 12:11:37,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 12:11:37,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 115 states and 163 transitions. [2018-11-10 12:11:37,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2018-11-10 12:11:37,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2018-11-10 12:11:37,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 163 transitions. [2018-11-10 12:11:37,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:11:37,204 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 163 transitions. [2018-11-10 12:11:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 163 transitions. [2018-11-10 12:11:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-10 12:11:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 12:11:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2018-11-10 12:11:37,229 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 163 transitions. [2018-11-10 12:11:37,229 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 163 transitions. [2018-11-10 12:11:37,230 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:11:37,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 163 transitions. [2018-11-10 12:11:37,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 12:11:37,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:11:37,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:11:37,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:11:37,233 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:11:37,234 INFO L793 eck$LassoCheckResult]: Stem: 366#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 274#L290 assume ~r1~0 == 0; 333#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 362#L292 assume ~id1~0 >= 0; 292#L293 assume ~st1~0 == 0; 293#L294 assume ~send1~0 == ~id1~0; 340#L295 assume ~mode1~0 % 256 == 0; 269#L296 assume ~id2~0 >= 0; 270#L297 assume ~st2~0 == 0; 345#L298 assume ~send2~0 == ~id2~0; 282#L299 assume ~mode2~0 % 256 == 0; 283#L300 assume ~id3~0 >= 0; 334#L301 assume ~st3~0 == 0; 335#L302 assume ~send3~0 == ~id3~0; 351#L303 assume ~mode3~0 % 256 == 0; 308#L304 assume ~id4~0 >= 0; 309#L305 assume ~st4~0 == 0; 347#L306 assume ~send4~0 == ~id4~0; 280#L307 assume ~mode4~0 % 256 == 0; 281#L308 assume ~id5~0 >= 0; 342#L309 assume ~st5~0 == 0; 267#L310 assume ~send5~0 == ~id5~0; 268#L311 assume ~mode5~0 % 256 == 0; 316#L312 assume ~id1~0 != ~id2~0; 317#L313 assume ~id1~0 != ~id3~0; 361#L314 assume ~id1~0 != ~id4~0; 306#L315 assume ~id1~0 != ~id5~0; 307#L316 assume ~id2~0 != ~id3~0; 346#L317 assume ~id2~0 != ~id4~0; 278#L318 assume ~id2~0 != ~id5~0; 279#L319 assume ~id3~0 != ~id4~0; 341#L320 assume ~id3~0 != ~id5~0; 265#L321 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 266#L290-1 init_#res := init_~tmp~0; 330#L419 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 319#L488-3 [2018-11-10 12:11:37,234 INFO L795 eck$LassoCheckResult]: Loop: 319#L488-3 assume true; 331#L488-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 332#L118 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 313#L122 assume !(node1_~m1~0 != ~nomsg~0); 315#L122-1 ~mode1~0 := 0; 272#L118-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 287#L153 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 289#L156 assume !(node2_~m2~0 != ~nomsg~0); 301#L156-1 ~mode2~0 := 0; 284#L153-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 285#L187 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 356#L190 assume !(node3_~m3~0 != ~nomsg~0); 326#L190-1 ~mode3~0 := 0; 349#L187-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 322#L221 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 323#L224 assume !(node4_~m4~0 != ~nomsg~0); 328#L224-1 ~mode4~0 := 0; 258#L221-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 275#L255 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 277#L258 assume !(node5_~m5~0 != ~nomsg~0); 264#L258-1 ~mode5~0 := 0; 364#L255-2 assume { :end_inline_node5 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 355#L427 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 291#L427-1 check_#res := check_~tmp~1; 294#L439 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 295#L518 assume !(assert_~arg % 256 == 0); 318#L513 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 319#L488-3 [2018-11-10 12:11:37,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 1 times [2018-11-10 12:11:37,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:37,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:37,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash 199422581, now seen corresponding path program 2 times [2018-11-10 12:11:37,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:37,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:37,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:37,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:37,379 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 12:11:37,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:11:37,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:11:37,380 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:11:37,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:11:37,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:11:37,380 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. cyclomatic complexity: 49 Second operand 5 states. [2018-11-10 12:11:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:11:37,421 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2018-11-10 12:11:37,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:11:37,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 165 transitions. [2018-11-10 12:11:37,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 12:11:37,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 115 states and 161 transitions. [2018-11-10 12:11:37,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2018-11-10 12:11:37,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2018-11-10 12:11:37,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 161 transitions. [2018-11-10 12:11:37,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:11:37,425 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 161 transitions. [2018-11-10 12:11:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 161 transitions. [2018-11-10 12:11:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-10 12:11:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 12:11:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2018-11-10 12:11:37,430 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 161 transitions. [2018-11-10 12:11:37,430 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 161 transitions. [2018-11-10 12:11:37,430 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:11:37,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 161 transitions. [2018-11-10 12:11:37,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 12:11:37,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:11:37,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:11:37,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:11:37,432 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:11:37,432 INFO L793 eck$LassoCheckResult]: Stem: 611#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;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 518#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 519#L290 assume ~r1~0 == 0; 578#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 607#L292 assume ~id1~0 >= 0; 537#L293 assume ~st1~0 == 0; 538#L294 assume ~send1~0 == ~id1~0; 585#L295 assume ~mode1~0 % 256 == 0; 514#L296 assume ~id2~0 >= 0; 515#L297 assume ~st2~0 == 0; 590#L298 assume ~send2~0 == ~id2~0; 527#L299 assume ~mode2~0 % 256 == 0; 528#L300 assume ~id3~0 >= 0; 579#L301 assume ~st3~0 == 0; 580#L302 assume ~send3~0 == ~id3~0; 596#L303 assume ~mode3~0 % 256 == 0; 553#L304 assume ~id4~0 >= 0; 554#L305 assume ~st4~0 == 0; 592#L306 assume ~send4~0 == ~id4~0; 525#L307 assume ~mode4~0 % 256 == 0; 526#L308 assume ~id5~0 >= 0; 587#L309 assume ~st5~0 == 0; 512#L310 assume ~send5~0 == ~id5~0; 513#L311 assume ~mode5~0 % 256 == 0; 561#L312 assume ~id1~0 != ~id2~0; 562#L313 assume ~id1~0 != ~id3~0; 606#L314 assume ~id1~0 != ~id4~0; 551#L315 assume ~id1~0 != ~id5~0; 552#L316 assume ~id2~0 != ~id3~0; 591#L317 assume ~id2~0 != ~id4~0; 523#L318 assume ~id2~0 != ~id5~0; 524#L319 assume ~id3~0 != ~id4~0; 586#L320 assume ~id3~0 != ~id5~0; 510#L321 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 511#L290-1 init_#res := init_~tmp~0; 575#L419 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 566#L488-3 [2018-11-10 12:11:37,432 INFO L795 eck$LassoCheckResult]: Loop: 566#L488-3 assume true; 576#L488-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 577#L118 assume ~mode1~0 % 256 != 0;~r1~0 := (if (~r1~0 + 1) % 256 <= 127 then (~r1~0 + 1) % 256 else (~r1~0 + 1) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 558#L122 assume !(node1_~m1~0 != ~nomsg~0); 560#L122-1 ~mode1~0 := 0; 517#L118-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 532#L153 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 534#L156 assume !(node2_~m2~0 != ~nomsg~0); 546#L156-1 ~mode2~0 := 0; 529#L153-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 530#L187 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 601#L190 assume !(node3_~m3~0 != ~nomsg~0); 571#L190-1 ~mode3~0 := 0; 594#L187-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 567#L221 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 568#L224 assume !(node4_~m4~0 != ~nomsg~0); 573#L224-1 ~mode4~0 := 0; 503#L221-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 520#L255 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 522#L258 assume !(node5_~m5~0 != ~nomsg~0); 509#L258-1 ~mode5~0 := 0; 609#L255-2 assume { :end_inline_node5 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 600#L427 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 541#L428 assume ~r1~0 < 5;check_~tmp~1 := 1; 536#L427-1 check_#res := check_~tmp~1; 539#L439 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 540#L518 assume !(assert_~arg % 256 == 0); 565#L513 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 566#L488-3 [2018-11-10 12:11:37,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 2 times [2018-11-10 12:11:37,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:37,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:37,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:11:37,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:37,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1503805655, now seen corresponding path program 1 times [2018-11-10 12:11:37,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:37,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:37,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:11:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:11:37,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash 500261995, now seen corresponding path program 1 times [2018-11-10 12:11:37,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:11:37,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:11:37,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:11:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:11:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:37,567 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 12:11:37,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:11:37,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:11:37,930 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 137 [2018-11-10 12:11:38,464 WARN L179 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2018-11-10 12:11:38,472 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:11:38,473 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:11:38,473 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:11:38,473 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:11:38,473 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:11:38,474 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:11:38,474 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:11:38,474 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:11:38,474 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-10 12:11:38,474 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:11:38,476 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:11:38,502 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 12:11:38,509 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 12:11:38,511 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 12:11:38,512 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 12:11:38,517 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 12:11:38,518 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 12:11:38,540 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 12:11:38,542 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 12:11:38,545 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 12:11:38,546 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 12:11:38,548 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 12:11:38,549 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 12:11:38,550 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 12:11:38,551 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 12:11:38,554 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 12:11:38,555 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 12:11:38,556 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 12:11:38,557 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 12:11:38,579 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 12:11:38,582 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 12:11:38,583 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 12:11:38,584 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 12:11:38,586 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 12:11:38,588 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 12:11:38,589 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 12:11:38,589 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 12:11:38,592 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 12:11:38,594 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 12:11:38,597 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 12:11:38,600 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 12:11:38,602 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 12:11:38,604 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 12:11:38,606 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 12:11:39,002 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:11:39,002 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/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 12:11:39,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:11:39,006 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9946ada-6d52-4868-895d-44a27c1021f2/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 12:11:39,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:11:39,041 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:11:39,145 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:11:39,146 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:11:39,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:11:39,147 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:11:39,147 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:11:39,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:11:39,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:11:39,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:11:39,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:11:39,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2018-11-10 12:11:39,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:11:39,147 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:11:39,150 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 12:11:39,156 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 12:11:39,158 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 12:11:39,159 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 12:11:39,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:39,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:39,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:11:39,187 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 12:11:39,190 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 12:11:39,191 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 12:11:39,212 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 12:11:39,213 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 12:11:39,214 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 12:11:39,216 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 12:11:39,219 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 12:11:39,220 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 12:11:39,221 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 12:11:39,222 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 12:11:39,223 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 12:11:39,227 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 12:11:39,228 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 12:11:39,229 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 12:11:39,230 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 12:11:39,234 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 12:11:39,236 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 12:11:39,237 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 12:11:39,238 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 12:11:39,239 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 12:11:39,241 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 12:11:39,244 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 12:11:39,248 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 12:11:39,249 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 12:11:39,250 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 12:11:39,627 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:11:39,632 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:11:39,633 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 12:11:39,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:39,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,641 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 12:11:39,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:11:39,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:11:39,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,649 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 12:11:39,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:11:39,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:11:39,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,654 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 12:11:39,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:39,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,661 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 12:11:39,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:39,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,664 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 12:11:39,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:11:39,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:11:39,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,670 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 12:11:39,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,670 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:11:39,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,671 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:11:39,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,675 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 12:11:39,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:39,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,683 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 12:11:39,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:11:39,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:11:39,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,688 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 12:11:39,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:39,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,695 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 12:11:39,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:39,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,698 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 12:11:39,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:39,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,701 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 12:11:39,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:39,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:11:39,709 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 12:11:39,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:11:39,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:11:39,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:11:39,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:11:39,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:11:39,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:11:39,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:11:39,711 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:11:39,714 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:11:39,715 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:11:39,716 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:11:39,717 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:11:39,717 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:11:39,717 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2018-11-10 12:11:39,718 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:11:39,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:11:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:39,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:11:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:11:39,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:11:39,836 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 12:11:39,839 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 12:11:39,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 161 transitions. cyclomatic complexity: 47 Second operand 4 states. [2018-11-10 12:11:39,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 161 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 194 states and 287 transitions. Complement of second has 6 states. [2018-11-10 12:11:39,895 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 12:11:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:11:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2018-11-10 12:11:39,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 161 transitions. Stem has 36 letters. Loop has 28 letters. [2018-11-10 12:11:39,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:11:39,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 161 transitions. Stem has 64 letters. Loop has 28 letters. [2018-11-10 12:11:39,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:11:39,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 161 transitions. Stem has 36 letters. Loop has 56 letters. [2018-11-10 12:11:39,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:11:39,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 287 transitions. [2018-11-10 12:11:39,902 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:11:39,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 0 states and 0 transitions. [2018-11-10 12:11:39,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:11:39,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:11:39,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:11:39,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:11:39,903 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:11:39,903 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:11:39,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:11:39,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:11:39,903 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 12:11:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:11:39,903 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 12:11:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:11:39,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 12:11:39,904 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:11:39,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:11:39,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:11:39,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:11:39,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:11:39,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:11:39,904 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:11:39,904 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:11:39,904 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:11:39,904 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:11:39,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:11:39,904 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:11:39,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:11:39,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:11:39 BoogieIcfgContainer [2018-11-10 12:11:39,911 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:11:39,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:11:39,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:11:39,911 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:11:39,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:11:36" (3/4) ... [2018-11-10 12:11:39,914 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:11:39,914 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:11:39,915 INFO L168 Benchmark]: Toolchain (without parser) took 4009.79 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.4 MB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -340.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:11:39,915 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:11:39,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.83 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 940.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:39,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -224.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:39,917 INFO L168 Benchmark]: Boogie Preprocessor took 27.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:39,918 INFO L168 Benchmark]: RCFGBuilder took 493.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:11:39,918 INFO L168 Benchmark]: BuchiAutomizer took 3135.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -188.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:11:39,918 INFO L168 Benchmark]: Witness Printer took 3.06 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:11:39,921 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.83 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 940.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -224.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 493.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3135.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -188.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.06 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 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 3.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 115 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 519 SDtfs, 285 SDslu, 963 SDs, 0 SdLazy, 22 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax120 hnf105 lsp16 ukn100 mio100 lsp100 div106 bol100 ite100 ukn100 eq215 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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...