./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.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_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/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 5564e2866529becd702f0ed3cd0d2d94f195a7b8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:55:23,881 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:55:23,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:55:23,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:55:23,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:55:23,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:55:23,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:55:23,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:55:23,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:55:23,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:55:23,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:55:23,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:55:23,896 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:55:23,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:55:23,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:55:23,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:55:23,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:55:23,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:55:23,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:55:23,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:55:23,903 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:55:23,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:55:23,905 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:55:23,905 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:55:23,905 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:55:23,906 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:55:23,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:55:23,907 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:55:23,908 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:55:23,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:55:23,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:55:23,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:55:23,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:55:23,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:55:23,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:55:23,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:55:23,911 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 10:55:23,921 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:55:23,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:55:23,922 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:55:23,923 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:55:23,923 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:55:23,923 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:55:23,923 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:55:23,923 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:55:23,923 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:55:23,924 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:55:23,924 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:55:23,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:55:23,924 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:55:23,924 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:55:23,924 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:55:23,924 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:55:23,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:55:23,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:55:23,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:55:23,925 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:55:23,925 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:55:23,925 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:55:23,925 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:55:23,925 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:55:23,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:55:23,926 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:55:23,926 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:55:23,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:55:23,926 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:55:23,926 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:55:23,927 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:55:23,927 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_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/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 -> 5564e2866529becd702f0ed3cd0d2d94f195a7b8 [2018-11-10 10:55:23,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:55:23,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:55:23,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:55:23,960 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:55:23,960 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:55:23,960 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-10 10:55:23,997 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/data/6bbe3f39a/052a091d08ca4700b6bb8d0d0c8101cc/FLAGed297efff [2018-11-10 10:55:24,332 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:55:24,332 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-10 10:55:24,338 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/data/6bbe3f39a/052a091d08ca4700b6bb8d0d0c8101cc/FLAGed297efff [2018-11-10 10:55:24,348 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/bin-2019/uautomizer/data/6bbe3f39a/052a091d08ca4700b6bb8d0d0c8101cc [2018-11-10 10:55:24,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:55:24,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:55:24,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:55:24,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:55:24,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:55:24,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3976356f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24, skipping insertion in model container [2018-11-10 10:55:24,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:55:24,390 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:55:24,533 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:55:24,540 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:55:24,584 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:55:24,595 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:55:24,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24 WrapperNode [2018-11-10 10:55:24,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:55:24,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:55:24,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:55:24,596 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:55:24,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:55:24,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:55:24,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:55:24,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:55:24,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... [2018-11-10 10:55:24,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:55:24,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:55:24,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:55:24,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:55:24,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/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 10:55:24,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:55:24,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:55:25,273 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:55:25,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:55:25 BoogieIcfgContainer [2018-11-10 10:55:25,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:55:25,274 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:55:25,274 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:55:25,277 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:55:25,278 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:55:25,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:55:24" (1/3) ... [2018-11-10 10:55:25,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76d05e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:55:25, skipping insertion in model container [2018-11-10 10:55:25,280 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:55:25,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:55:24" (2/3) ... [2018-11-10 10:55:25,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76d05e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:55:25, skipping insertion in model container [2018-11-10 10:55:25,280 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:55:25,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:55:25" (3/3) ... [2018-11-10 10:55:25,282 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-10 10:55:25,332 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:55:25,332 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:55:25,332 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:55:25,333 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:55:25,333 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:55:25,333 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:55:25,333 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:55:25,333 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:55:25,333 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:55:25,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states. [2018-11-10 10:55:25,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-11-10 10:55:25,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:55:25,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:55:25,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:55:25,382 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, 1, 1, 1] [2018-11-10 10:55:25,382 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:55:25,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states. [2018-11-10 10:55:25,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2018-11-10 10:55:25,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:55:25,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:55:25,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:55:25,389 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, 1, 1, 1] [2018-11-10 10:55:25,395 INFO L793 eck$LassoCheckResult]: Stem: 106#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;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~alive6~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;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 43#L334true assume !(~r1~0 == 0);init_~tmp~0 := 0; 45#L334-1true init_#res := init_~tmp~0; 51#L499true main_#t~ret43 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 108#L575-3true [2018-11-10 10:55:25,396 INFO L795 eck$LassoCheckResult]: Loop: 108#L575-3true assume true; 105#L575-1true assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 119#L126true 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 71#L130true assume !(node1_~m1~0 != ~nomsg~0); 69#L130-1true ~mode1~0 := 0; 113#L126-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; 75#L163true assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 46#L166true assume !(node2_~m2~0 != ~nomsg~0); 44#L166-1true ~mode2~0 := 0; 70#L163-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; 4#L197true assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 134#L200true assume !(node3_~m3~0 != ~nomsg~0); 133#L200-1true ~mode3~0 := 0; 21#L197-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; 102#L231true assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 104#L234true assume !(node4_~m4~0 != ~nomsg~0); 83#L234-1true ~mode4~0 := 0; 97#L231-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; 48#L265true assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 54#L268true assume !(node5_~m5~0 != ~nomsg~0); 53#L268-1true ~mode5~0 := 0; 47#L265-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 17#L299true assume ~mode6~0 % 256 != 0;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 143#L302true assume !(node6_~m6~0 != ~nomsg~0); 140#L302-1true ~mode6~0 := 0; 135#L299-2true assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 74#L507true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 77#L507-1true check_#res := check_~tmp~1; 18#L519true main_#t~ret44 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;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; 118#L608true assume !(assert_~arg % 256 == 0); 93#L603true assume { :end_inline_assert } true;main_#t~post45 := main_~i2~0;main_~i2~0 := main_#t~post45 + 1;havoc main_#t~post45; 108#L575-3true [2018-11-10 10:55:25,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:55:25,401 INFO L82 PathProgramCache]: Analyzing trace with hash 28934070, now seen corresponding path program 1 times [2018-11-10 10:55:25,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:55:25,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:55:25,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:25,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:55:25,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:55:25,546 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 10:55:25,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:55:25,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:55:25,552 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:55:25,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:55:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1608705424, now seen corresponding path program 1 times [2018-11-10 10:55:25,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:55:25,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:55:25,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:25,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:55:25,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:55:25,645 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 10:55:25,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:55:25,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:55:25,647 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:55:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:55:25,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:55:25,658 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2018-11-10 10:55:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:55:25,741 INFO L93 Difference]: Finished difference Result 145 states and 242 transitions. [2018-11-10 10:55:25,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:55:25,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 242 transitions. [2018-11-10 10:55:25,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-10 10:55:25,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 138 states and 195 transitions. [2018-11-10 10:55:25,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-10 10:55:25,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2018-11-10 10:55:25,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 195 transitions. [2018-11-10 10:55:25,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:55:25,755 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-11-10 10:55:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 195 transitions. [2018-11-10 10:55:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-10 10:55:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-10 10:55:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 195 transitions. [2018-11-10 10:55:25,783 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-11-10 10:55:25,783 INFO L608 BuchiCegarLoop]: Abstraction has 138 states and 195 transitions. [2018-11-10 10:55:25,784 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:55:25,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 195 transitions. [2018-11-10 10:55:25,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-10 10:55:25,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:55:25,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:55:25,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:55:25,787 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, 1, 1, 1] [2018-11-10 10:55:25,788 INFO L793 eck$LassoCheckResult]: Stem: 433#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;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~alive6~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;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 324#L334 assume ~r1~0 == 0; 374#L335 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 427#L336 assume ~id1~0 >= 0; 364#L337 assume ~st1~0 == 0; 365#L338 assume ~send1~0 == ~id1~0; 405#L339 assume ~mode1~0 % 256 == 0; 325#L340 assume ~id2~0 >= 0; 326#L341 assume ~st2~0 == 0; 399#L342 assume ~send2~0 == ~id2~0; 315#L343 assume ~mode2~0 % 256 == 0; 316#L344 assume ~id3~0 >= 0; 372#L345 assume ~st3~0 == 0; 373#L346 assume ~send3~0 == ~id3~0; 425#L347 assume ~mode3~0 % 256 == 0; 361#L348 assume ~id4~0 >= 0; 362#L349 assume ~st4~0 == 0; 404#L350 assume ~send4~0 == ~id4~0; 348#L351 assume ~mode4~0 % 256 == 0; 349#L352 assume ~id5~0 >= 0; 398#L353 assume ~st5~0 == 0; 312#L354 assume ~send5~0 == ~id5~0; 313#L355 assume ~mode5~0 % 256 == 0; 370#L356 assume ~id6~0 >= 0; 371#L357 assume ~st6~0 == 0; 423#L358 assume ~send6~0 == ~id6~0; 358#L359 assume ~mode6~0 % 256 == 0; 359#L360 assume ~id1~0 != ~id2~0; 403#L361 assume ~id1~0 != ~id3~0; 346#L362 assume ~id1~0 != ~id4~0; 347#L363 assume ~id1~0 != ~id5~0; 397#L364 assume ~id1~0 != ~id6~0; 310#L365 assume ~id2~0 != ~id3~0; 311#L366 assume ~id2~0 != ~id4~0; 391#L367 assume ~id2~0 != ~id5~0; 392#L368 assume ~id2~0 != ~id6~0; 422#L369 assume ~id3~0 != ~id4~0; 356#L370 assume ~id3~0 != ~id5~0; 357#L371 assume ~id3~0 != ~id6~0; 402#L372 assume ~id4~0 != ~id5~0; 344#L373 assume ~id4~0 != ~id6~0; 345#L374 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 376#L334-1 init_#res := init_~tmp~0; 377#L499 main_#t~ret43 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 385#L575-3 [2018-11-10 10:55:25,788 INFO L795 eck$LassoCheckResult]: Loop: 385#L575-3 assume true; 431#L575-1 assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 432#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 408#L130 assume !(node1_~m1~0 != ~nomsg~0); 336#L130-1 ~mode1~0 := 0; 401#L126-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; 411#L163 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 378#L166 assume !(node2_~m2~0 != ~nomsg~0); 375#L166-1 ~mode2~0 := 0; 354#L163-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; 305#L197 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 307#L200 assume !(node3_~m3~0 != ~nomsg~0); 367#L200-1 ~mode3~0 := 0; 338#L197-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; 339#L231 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 430#L234 assume !(node4_~m4~0 != ~nomsg~0); 387#L234-1 ~mode4~0 := 0; 412#L231-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; 380#L265 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 381#L268 assume !(node5_~m5~0 != ~nomsg~0); 389#L268-1 ~mode5~0 := 0; 309#L265-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 329#L299 assume ~mode6~0 % 256 != 0;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 331#L302 assume !(node6_~m6~0 != ~nomsg~0); 328#L302-1 ~mode6~0 := 0; 434#L299-2 assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 409#L507 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 320#L507-1 check_#res := check_~tmp~1; 332#L519 main_#t~ret44 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;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; 333#L608 assume !(assert_~arg % 256 == 0); 424#L603 assume { :end_inline_assert } true;main_#t~post45 := main_~i2~0;main_~i2~0 := main_#t~post45 + 1;havoc main_#t~post45; 385#L575-3 [2018-11-10 10:55:25,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:55:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 1 times [2018-11-10 10:55:25,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:55:25,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:55:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:25,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:55:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:55:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:55:25,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:55:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1608705424, now seen corresponding path program 2 times [2018-11-10 10:55:25,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:55:25,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:55:25,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:25,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:55:25,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:55:25,947 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 10:55:25,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:55:25,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:55:25,948 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:55:25,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:55:25,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:55:25,948 INFO L87 Difference]: Start difference. First operand 138 states and 195 transitions. cyclomatic complexity: 58 Second operand 5 states. [2018-11-10 10:55:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:55:26,008 INFO L93 Difference]: Finished difference Result 141 states and 197 transitions. [2018-11-10 10:55:26,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:55:26,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 197 transitions. [2018-11-10 10:55:26,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-10 10:55:26,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 138 states and 193 transitions. [2018-11-10 10:55:26,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-10 10:55:26,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2018-11-10 10:55:26,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 193 transitions. [2018-11-10 10:55:26,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:55:26,014 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 193 transitions. [2018-11-10 10:55:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 193 transitions. [2018-11-10 10:55:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-10 10:55:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-10 10:55:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 193 transitions. [2018-11-10 10:55:26,021 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 193 transitions. [2018-11-10 10:55:26,021 INFO L608 BuchiCegarLoop]: Abstraction has 138 states and 193 transitions. [2018-11-10 10:55:26,021 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:55:26,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 193 transitions. [2018-11-10 10:55:26,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-10 10:55:26,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:55:26,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:55:26,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:55:26,024 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, 1, 1, 1, 1] [2018-11-10 10:55:26,024 INFO L793 eck$LassoCheckResult]: Stem: 724#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;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~alive6~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;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc 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~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 615#L334 assume ~r1~0 == 0; 666#L335 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 718#L336 assume ~id1~0 >= 0; 655#L337 assume ~st1~0 == 0; 656#L338 assume ~send1~0 == ~id1~0; 696#L339 assume ~mode1~0 % 256 == 0; 616#L340 assume ~id2~0 >= 0; 617#L341 assume ~st2~0 == 0; 690#L342 assume ~send2~0 == ~id2~0; 606#L343 assume ~mode2~0 % 256 == 0; 607#L344 assume ~id3~0 >= 0; 663#L345 assume ~st3~0 == 0; 664#L346 assume ~send3~0 == ~id3~0; 717#L347 assume ~mode3~0 % 256 == 0; 653#L348 assume ~id4~0 >= 0; 654#L349 assume ~st4~0 == 0; 695#L350 assume ~send4~0 == ~id4~0; 642#L351 assume ~mode4~0 % 256 == 0; 643#L352 assume ~id5~0 >= 0; 689#L353 assume ~st5~0 == 0; 603#L354 assume ~send5~0 == ~id5~0; 604#L355 assume ~mode5~0 % 256 == 0; 661#L356 assume ~id6~0 >= 0; 662#L357 assume ~st6~0 == 0; 714#L358 assume ~send6~0 == ~id6~0; 649#L359 assume ~mode6~0 % 256 == 0; 650#L360 assume ~id1~0 != ~id2~0; 694#L361 assume ~id1~0 != ~id3~0; 637#L362 assume ~id1~0 != ~id4~0; 638#L363 assume ~id1~0 != ~id5~0; 688#L364 assume ~id1~0 != ~id6~0; 601#L365 assume ~id2~0 != ~id3~0; 602#L366 assume ~id2~0 != ~id4~0; 682#L367 assume ~id2~0 != ~id5~0; 683#L368 assume ~id2~0 != ~id6~0; 713#L369 assume ~id3~0 != ~id4~0; 647#L370 assume ~id3~0 != ~id5~0; 648#L371 assume ~id3~0 != ~id6~0; 693#L372 assume ~id4~0 != ~id5~0; 635#L373 assume ~id4~0 != ~id6~0; 636#L374 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 667#L334-1 init_#res := init_~tmp~0; 668#L499 main_#t~ret43 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 676#L575-3 [2018-11-10 10:55:26,024 INFO L795 eck$LassoCheckResult]: Loop: 676#L575-3 assume true; 722#L575-1 assume !!(main_~i2~0 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 723#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 699#L130 assume !(node1_~m1~0 != ~nomsg~0); 629#L130-1 ~mode1~0 := 0; 692#L126-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; 702#L163 assume ~mode2~0 % 256 != 0;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 669#L166 assume !(node2_~m2~0 != ~nomsg~0); 665#L166-1 ~mode2~0 := 0; 645#L163-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; 596#L197 assume ~mode3~0 % 256 != 0;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 598#L200 assume !(node3_~m3~0 != ~nomsg~0); 658#L200-1 ~mode3~0 := 0; 626#L197-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; 627#L231 assume ~mode4~0 % 256 != 0;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 721#L234 assume !(node4_~m4~0 != ~nomsg~0); 678#L234-1 ~mode4~0 := 0; 703#L231-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; 671#L265 assume ~mode5~0 % 256 != 0;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 672#L268 assume !(node5_~m5~0 != ~nomsg~0); 680#L268-1 ~mode5~0 := 0; 600#L265-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 620#L299 assume ~mode6~0 % 256 != 0;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 622#L302 assume !(node6_~m6~0 != ~nomsg~0); 619#L302-1 ~mode6~0 := 0; 725#L299-2 assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 701#L507 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 625#L508 assume ~r1~0 < 6;check_~tmp~1 := 1; 611#L507-1 check_#res := check_~tmp~1; 623#L519 main_#t~ret44 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;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; 624#L608 assume !(assert_~arg % 256 == 0); 716#L603 assume { :end_inline_assert } true;main_#t~post45 := main_~i2~0;main_~i2~0 := main_#t~post45 + 1;havoc main_#t~post45; 676#L575-3 [2018-11-10 10:55:26,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:55:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 2 times [2018-11-10 10:55:26,025 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:55:26,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:55:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:26,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:55:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:55:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:55:26,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:55:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2053066356, now seen corresponding path program 1 times [2018-11-10 10:55:26,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:55:26,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:55:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:26,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:55:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:55:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:55:26,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:55:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2020473867, now seen corresponding path program 1 times [2018-11-10 10:55:26,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:55:26,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:55:26,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:26,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:55:26,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:55:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:55:26,167 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 10:55:26,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:55:26,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:55:26,516 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2018-11-10 10:55:27,103 WARN L179 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2018-11-10 10:55:27,112 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:55:27,113 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:55:27,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:55:27,113 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:55:27,113 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:55:27,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:55:27,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:55:27,114 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:55:27,114 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2018-11-10 10:55:27,114 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:55:27,114 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:55:27,138 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 10:55:27,149 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 10:55:27,151 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 10:55:27,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 10:55:27,157 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 10:55:27,163 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 10:55:27,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 10:55:27,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:55:27,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 10:55:27,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 10:55:27,194 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 10:55:27,195 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 10:55:27,197 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 10:55:27,198 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 10:55:27,199 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 10:55:27,207 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 10:55:27,209 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 10:55:27,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 10:55:27,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 10:55:27,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 10:55:27,217 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 10:55:27,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 10:55:27,247 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 10:55:27,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 10:55:27,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 10:55:27,251 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 10:55:27,252 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 10:55:27,253 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 10:55:27,256 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 10:55:27,257 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 10:55:27,258 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 10:55:27,259 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 10:55:27,261 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 10:55:27,262 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 10:55:27,266 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 10:55:27,267 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 10:55:27,268 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 10:55:27,269 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 10:55:27,724 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:55:27,725 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/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 10:55:27,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:55:27,729 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_768120fc-a081-4afc-a0e1-a46cf9c6b1a3/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 10:55:27,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:55:27,751 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:55:27,855 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:55:27,856 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:55:27,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:55:27,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:55:27,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:55:27,856 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:55:27,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:55:27,857 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:55:27,857 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:55:27,857 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2018-11-10 10:55:27,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:55:27,857 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:55:27,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:55:27,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:55:27,868 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 10:55:27,869 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 10:55:27,871 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 10:55:27,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:55:27,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:55:27,880 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 10:55:27,909 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 10:55:27,910 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 10:55:27,913 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 10:55:27,914 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 10:55:27,915 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 10:55:27,916 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 10:55:27,918 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 10:55:27,921 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 10:55:27,922 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 10:55:27,924 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 10:55:27,925 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 10:55:27,929 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 10:55:27,930 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 10:55:27,931 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 10:55:27,933 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 10:55:27,937 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 10:55:27,938 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 10:55:27,940 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 10:55:27,947 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 10:55:27,949 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 10:55:27,950 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 10:55:27,952 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 10:55:27,987 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 10:55:27,988 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 10:55:27,990 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 10:55:27,993 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 10:55:27,998 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 10:55:27,999 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 10:55:28,000 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 10:55:28,003 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 10:55:28,460 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:55:28,464 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:55:28,465 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 10:55:28,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:55:28,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,472 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 10:55:28,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:55:28,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:55:28,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,476 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 10:55:28,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:55:28,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,478 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 10:55:28,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:55:28,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:55:28,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,482 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 10:55:28,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:55:28,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,486 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 10:55:28,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:55:28,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,492 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 10:55:28,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:55:28,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:55:28,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,496 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 10:55:28,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,497 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:55:28,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,498 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:55:28,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,506 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 10:55:28,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:55:28,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:55:28,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,512 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 10:55:28,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:55:28,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,515 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 10:55:28,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:55:28,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:55:28,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,519 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 10:55:28,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:55:28,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,521 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 10:55:28,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:55:28,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,523 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 10:55:28,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:55:28,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:55:28,525 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 10:55:28,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:55:28,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:55:28,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:55:28,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:55:28,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:55:28,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:55:28,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:55:28,527 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:55:28,530 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:55:28,530 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 10:55:28,532 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:55:28,532 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 10:55:28,532 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:55:28,532 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2018-11-10 10:55:28,533 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 10:55:28,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:55:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:55:28,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:55:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:55:28,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:55:28,633 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 10:55:28,635 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 10:55:28,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 138 states and 193 transitions. cyclomatic complexity: 56 Second operand 4 states. [2018-11-10 10:55:28,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 138 states and 193 transitions. cyclomatic complexity: 56. Second operand 4 states. Result 231 states and 342 transitions. Complement of second has 6 states. [2018-11-10 10:55:28,685 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 10:55:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:55:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2018-11-10 10:55:28,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 193 transitions. Stem has 45 letters. Loop has 32 letters. [2018-11-10 10:55:28,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:55:28,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 193 transitions. Stem has 77 letters. Loop has 32 letters. [2018-11-10 10:55:28,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:55:28,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 193 transitions. Stem has 45 letters. Loop has 64 letters. [2018-11-10 10:55:28,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:55:28,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 342 transitions. [2018-11-10 10:55:28,692 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:55:28,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2018-11-10 10:55:28,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:55:28,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:55:28,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:55:28,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:55:28,693 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:55:28,693 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:55:28,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:55:28,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:55:28,693 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 10:55:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:55:28,693 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 10:55:28,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:55:28,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 10:55:28,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:55:28,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:55:28,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:55:28,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:55:28,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:55:28,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:55:28,694 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:55:28,694 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:55:28,694 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:55:28,694 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:55:28,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:55:28,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:55:28,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:55:28,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:55:28 BoogieIcfgContainer [2018-11-10 10:55:28,700 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:55:28,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:55:28,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:55:28,700 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:55:28,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:55:25" (3/4) ... [2018-11-10 10:55:28,704 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:55:28,704 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:55:28,704 INFO L168 Benchmark]: Toolchain (without parser) took 4352.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 125.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:55:28,705 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:55:28,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.88 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 940.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:55:28,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:55:28,706 INFO L168 Benchmark]: Boogie Preprocessor took 31.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:55:28,707 INFO L168 Benchmark]: RCFGBuilder took 563.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:55:28,707 INFO L168 Benchmark]: BuchiAutomizer took 3425.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -80.7 MB). Peak memory consumption was 95.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:55:28,708 INFO L168 Benchmark]: Witness Printer took 3.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:55:28,711 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.88 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 940.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 563.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3425.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -80.7 MB). Peak memory consumption was 95.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 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.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. 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 138 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 624 SDtfs, 340 SDslu, 1155 SDs, 0 SdLazy, 22 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax121 hnf105 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...