./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/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 d6fc39c41c06c7ae6beaa03fe622faa9944187b4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:39:50,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:39:50,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:39:50,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:39:50,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:39:50,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:39:50,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:39:50,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:39:50,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:39:50,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:39:50,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:39:50,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:39:50,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:39:50,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:39:50,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:39:50,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:39:50,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:39:50,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:39:50,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:39:50,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:39:50,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:39:50,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:39:50,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:39:50,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:39:50,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:39:50,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:39:50,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:39:50,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:39:50,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:39:50,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:39:50,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:39:50,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:39:50,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:39:50,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:39:50,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:39:50,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:39:50,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:39:50,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:39:50,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:39:50,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:39:50,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:39:50,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:39:50,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:39:50,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:39:50,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:39:50,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:39:50,561 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:39:50,562 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:39:50,562 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:39:50,562 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:39:50,562 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:39:50,563 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:39:50,563 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:39:50,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:39:50,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:39:50,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:39:50,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:39:50,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:39:50,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:39:50,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:39:50,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:39:50,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:39:50,565 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:39:50,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:39:50,566 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:39:50,566 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:39:50,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:39:50,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:39:50,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:39:50,567 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:39:50,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:39:50,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:39:50,568 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:39:50,568 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:39:50,569 INFO L138 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/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/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 -> d6fc39c41c06c7ae6beaa03fe622faa9944187b4 [2019-11-15 23:39:50,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:39:50,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:39:50,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:39:50,605 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:39:50,606 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:39:50,606 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2019-11-15 23:39:50,655 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/data/8079ae48a/029c0b5b2a1f499b84c00c3fb511181c/FLAG88117a5c9 [2019-11-15 23:39:51,107 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:39:51,108 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2019-11-15 23:39:51,119 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/data/8079ae48a/029c0b5b2a1f499b84c00c3fb511181c/FLAG88117a5c9 [2019-11-15 23:39:51,441 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/data/8079ae48a/029c0b5b2a1f499b84c00c3fb511181c [2019-11-15 23:39:51,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:39:51,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:39:51,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:39:51,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:39:51,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:39:51,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a3561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51, skipping insertion in model container [2019-11-15 23:39:51,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,463 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:39:51,511 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:39:51,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:39:51,823 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:39:51,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:39:51,887 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:39:51,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51 WrapperNode [2019-11-15 23:39:51,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:39:51,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:39:51,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:39:51,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:39:51,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:39:51,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:39:51,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:39:51,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:39:51,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... [2019-11-15 23:39:51,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:39:51,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:39:51,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:39:51,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:39:51,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/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 [2019-11-15 23:39:52,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:39:52,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:39:52,613 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:39:52,614 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-11-15 23:39:52,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:39:52 BoogieIcfgContainer [2019-11-15 23:39:52,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:39:52,616 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:39:52,616 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:39:52,619 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:39:52,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:39:52,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:39:51" (1/3) ... [2019-11-15 23:39:52,620 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65b13bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:39:52, skipping insertion in model container [2019-11-15 23:39:52,621 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:39:52,621 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:51" (2/3) ... [2019-11-15 23:39:52,622 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65b13bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:39:52, skipping insertion in model container [2019-11-15 23:39:52,622 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:39:52,622 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:39:52" (3/3) ... [2019-11-15 23:39:52,624 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2019-11-15 23:39:52,667 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:39:52,668 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:39:52,668 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:39:52,668 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:39:52,668 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:39:52,669 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:39:52,669 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:39:52,670 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:39:52,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states. [2019-11-15 23:39:52,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-15 23:39:52,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:39:52,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:39:52,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:39:52,736 INFO L850 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] [2019-11-15 23:39:52,736 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:39:52,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states. [2019-11-15 23:39:52,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-15 23:39:52,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:39:52,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:39:52,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:39:52,752 INFO L850 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] [2019-11-15 23:39:52,760 INFO L791 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~alive1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id2~0 := main_#t~nondet14;havoc main_#t~nondet14;~st2~0 := main_#t~nondet15;havoc main_#t~nondet15;~send2~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode2~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive4~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 26#L249true assume !(0 == ~r1~0);init_~tmp~0 := 0; 25#L249-1true init_#res := init_~tmp~0; 98#L346true main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29;assume 0 != main_~i2~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;main_~i2~0 := 0; 44#L408-2true [2019-11-15 23:39:52,762 INFO L793 eck$LassoCheckResult]: Loop: 44#L408-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 77#L110true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 19#L114true assume !(node1_~m1~0 != ~nomsg~0); 16#L114-1true ~mode1~0 := 0; 75#L110-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 21#L147true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 24#L150true assume !(node2_~m2~0 != ~nomsg~0); 23#L150-1true ~mode2~0 := 0; 17#L147-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 94#L181true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 85#L184true assume !(node3_~m3~0 != ~nomsg~0); 84#L184-1true ~mode3~0 := 0; 82#L181-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 59#L215true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 40#L218true assume !(node4_~m4~0 != ~nomsg~0); 51#L218-1true ~mode4~0 := 0; 56#L215-2true ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 5#L354true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 8#L354-1true check_#res := check_~tmp~1; 65#L366true main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 57#L435true assume !(0 == assert_~arg % 256); 41#L430true main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 44#L408-2true [2019-11-15 23:39:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:52,767 INFO L82 PathProgramCache]: Analyzing trace with hash 28832784, now seen corresponding path program 1 times [2019-11-15 23:39:52,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:52,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676964599] [2019-11-15 23:39:52,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:52,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:52,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:52,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676964599] [2019-11-15 23:39:52,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:52,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:52,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561082640] [2019-11-15 23:39:52,986 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:39:52,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:52,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1703887177, now seen corresponding path program 1 times [2019-11-15 23:39:52,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:52,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870632700] [2019-11-15 23:39:52,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:52,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:52,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:53,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870632700] [2019-11-15 23:39:53,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:53,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:39:53,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808750641] [2019-11-15 23:39:53,114 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:39:53,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:53,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:53,131 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 4 states. [2019-11-15 23:39:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:53,209 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2019-11-15 23:39:53,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:53,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 161 transitions. [2019-11-15 23:39:53,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-11-15 23:39:53,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 92 states and 131 transitions. [2019-11-15 23:39:53,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-11-15 23:39:53,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-15 23:39:53,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 131 transitions. [2019-11-15 23:39:53,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:39:53,225 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 131 transitions. [2019-11-15 23:39:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 131 transitions. [2019-11-15 23:39:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-15 23:39:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 23:39:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2019-11-15 23:39:53,256 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 131 transitions. [2019-11-15 23:39:53,256 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 131 transitions. [2019-11-15 23:39:53,256 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:39:53,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 131 transitions. [2019-11-15 23:39:53,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-11-15 23:39:53,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:39:53,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:39:53,260 INFO L849 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] [2019-11-15 23:39:53,260 INFO L850 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] [2019-11-15 23:39:53,261 INFO L791 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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]; 232#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~alive1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id2~0 := main_#t~nondet14;havoc main_#t~nondet14;~st2~0 := main_#t~nondet15;havoc main_#t~nondet15;~send2~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode2~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive4~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 233#L249 assume 0 == ~r1~0; 281#L250 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 283#L251 assume ~id1~0 >= 0; 222#L252 assume 0 == ~st1~0; 223#L253 assume ~send1~0 == ~id1~0; 266#L254 assume 0 == ~mode1~0 % 256; 234#L255 assume ~id2~0 >= 0; 235#L256 assume 0 == ~st2~0; 274#L257 assume ~send2~0 == ~id2~0; 293#L258 assume 0 == ~mode2~0 % 256; 248#L259 assume ~id3~0 >= 0; 249#L260 assume 0 == ~st3~0; 282#L261 assume ~send3~0 == ~id3~0; 284#L262 assume 0 == ~mode3~0 % 256; 224#L263 assume ~id4~0 >= 0; 225#L264 assume 0 == ~st4~0; 267#L265 assume ~send4~0 == ~id4~0; 236#L266 assume 0 == ~mode4~0 % 256; 237#L267 assume ~id1~0 != ~id2~0; 275#L268 assume ~id1~0 != ~id3~0; 294#L269 assume ~id1~0 != ~id4~0; 250#L270 assume ~id2~0 != ~id3~0; 251#L271 assume ~id2~0 != ~id4~0; 255#L272 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 277#L249-1 init_#res := init_~tmp~0; 278#L346 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29;assume 0 != main_~i2~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;main_~i2~0 := 0; 298#L408-2 [2019-11-15 23:39:53,261 INFO L793 eck$LassoCheckResult]: Loop: 298#L408-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 279#L110 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 264#L114 assume !(node1_~m1~0 != ~nomsg~0); 259#L114-1 ~mode1~0 := 0; 260#L110-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 269#L147 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 270#L150 assume !(node2_~m2~0 != ~nomsg~0); 272#L150-1 ~mode2~0 := 0; 261#L147-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 262#L181 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 296#L184 assume !(node3_~m3~0 != ~nomsg~0); 213#L184-1 ~mode3~0 := 0; 227#L181-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 243#L215 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 245#L218 assume !(node4_~m4~0 != ~nomsg~0); 215#L218-1 ~mode4~0 := 0; 238#L215-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 219#L354 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 220#L354-1 check_#res := check_~tmp~1; 228#L366 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 239#L435 assume !(0 == assert_~arg % 256); 240#L430 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 298#L408-2 [2019-11-15 23:39:53,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:53,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 1 times [2019-11-15 23:39:53,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:53,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046300108] [2019-11-15 23:39:53,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:39:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:39:53,366 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:39:53,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:53,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1703887177, now seen corresponding path program 2 times [2019-11-15 23:39:53,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:53,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46277651] [2019-11-15 23:39:53,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:53,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46277651] [2019-11-15 23:39:53,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:53,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:39:53,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442843187] [2019-11-15 23:39:53,469 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:39:53,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:53,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:39:53,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:39:53,470 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. cyclomatic complexity: 40 Second operand 5 states. [2019-11-15 23:39:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:53,547 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2019-11-15 23:39:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:39:53,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 133 transitions. [2019-11-15 23:39:53,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-11-15 23:39:53,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 92 states and 129 transitions. [2019-11-15 23:39:53,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-11-15 23:39:53,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-11-15 23:39:53,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 129 transitions. [2019-11-15 23:39:53,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:39:53,553 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2019-11-15 23:39:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 129 transitions. [2019-11-15 23:39:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-15 23:39:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 23:39:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2019-11-15 23:39:53,559 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2019-11-15 23:39:53,559 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2019-11-15 23:39:53,559 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:39:53,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 129 transitions. [2019-11-15 23:39:53,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-11-15 23:39:53,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:39:53,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:39:53,562 INFO L849 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] [2019-11-15 23:39:53,563 INFO L850 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] [2019-11-15 23:39:53,563 INFO L791 eck$LassoCheckResult]: Stem: 472#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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]; 431#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~alive1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id2~0 := main_#t~nondet14;havoc main_#t~nondet14;~st2~0 := main_#t~nondet15;havoc main_#t~nondet15;~send2~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode2~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive4~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 432#L249 assume 0 == ~r1~0; 480#L250 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 482#L251 assume ~id1~0 >= 0; 420#L252 assume 0 == ~st1~0; 421#L253 assume ~send1~0 == ~id1~0; 465#L254 assume 0 == ~mode1~0 % 256; 433#L255 assume ~id2~0 >= 0; 434#L256 assume 0 == ~st2~0; 473#L257 assume ~send2~0 == ~id2~0; 492#L258 assume 0 == ~mode2~0 % 256; 446#L259 assume ~id3~0 >= 0; 447#L260 assume 0 == ~st3~0; 481#L261 assume ~send3~0 == ~id3~0; 483#L262 assume 0 == ~mode3~0 % 256; 422#L263 assume ~id4~0 >= 0; 423#L264 assume 0 == ~st4~0; 466#L265 assume ~send4~0 == ~id4~0; 435#L266 assume 0 == ~mode4~0 % 256; 436#L267 assume ~id1~0 != ~id2~0; 474#L268 assume ~id1~0 != ~id3~0; 493#L269 assume ~id1~0 != ~id4~0; 449#L270 assume ~id2~0 != ~id3~0; 450#L271 assume ~id2~0 != ~id4~0; 454#L272 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 476#L249-1 init_#res := init_~tmp~0; 477#L346 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29;assume 0 != main_~i2~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;main_~i2~0 := 0; 497#L408-2 [2019-11-15 23:39:53,563 INFO L793 eck$LassoCheckResult]: Loop: 497#L408-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 478#L110 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 463#L114 assume !(node1_~m1~0 != ~nomsg~0); 458#L114-1 ~mode1~0 := 0; 459#L110-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 468#L147 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 469#L150 assume !(node2_~m2~0 != ~nomsg~0); 471#L150-1 ~mode2~0 := 0; 460#L147-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 461#L181 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 495#L184 assume !(node3_~m3~0 != ~nomsg~0); 412#L184-1 ~mode3~0 := 0; 425#L181-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 442#L215 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 444#L218 assume !(node4_~m4~0 != ~nomsg~0); 414#L218-1 ~mode4~0 := 0; 437#L215-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 418#L354 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 419#L355 assume ~r1~0 < 4;check_~tmp~1 := 1; 426#L354-1 check_#res := check_~tmp~1; 427#L366 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 438#L435 assume !(0 == assert_~arg % 256); 439#L430 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 497#L408-2 [2019-11-15 23:39:53,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 2 times [2019-11-15 23:39:53,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:53,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311436618] [2019-11-15 23:39:53,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:39:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:39:53,641 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:39:53,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:53,645 INFO L82 PathProgramCache]: Analyzing trace with hash 897567768, now seen corresponding path program 1 times [2019-11-15 23:39:53,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:53,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817440905] [2019-11-15 23:39:53,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:39:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:39:53,703 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:39:53,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:53,710 INFO L82 PathProgramCache]: Analyzing trace with hash 490525712, now seen corresponding path program 1 times [2019-11-15 23:39:53,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:53,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195391034] [2019-11-15 23:39:53,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:53,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195391034] [2019-11-15 23:39:53,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:53,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:39:53,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618468743] [2019-11-15 23:39:54,196 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 117 [2019-11-15 23:39:54,993 WARN L191 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2019-11-15 23:39:55,004 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:39:55,004 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:39:55,004 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:39:55,005 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:39:55,005 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:39:55,005 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:39:55,005 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:39:55,005 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:39:55,006 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2019-11-15 23:39:55,006 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:39:55,006 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:39:55,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,793 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:39:55,794 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/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 [2019-11-15 23:39:55,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:39:55,802 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_54a9bafc-4f61-438b-92f5-9aaa5fd3de9d/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:39:55,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:39:55,831 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:39:55,966 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:39:55,968 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:39:55,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:39:55,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:39:55,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:39:55,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:39:55,969 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:39:55,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:39:55,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:39:55,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2019-11-15 23:39:55,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:39:55,970 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:39:55,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:55,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:39:56,684 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:39:56,689 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:39:56,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,692 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,695 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:39:56,695 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,702 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:39:56,702 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:39:56,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,705 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,705 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,705 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:39:56,706 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,708 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,708 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,708 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:39:56,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,712 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:39:56,712 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:39:56,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,715 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,716 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:39:56,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,721 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:39:56,721 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:39:56,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,724 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,724 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,724 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:39:56,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,726 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:39:56,726 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,733 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:39:56,733 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:39:56,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,737 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:39:56,737 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,739 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,739 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,740 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:39:56,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,742 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,743 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:39:56,743 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,746 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:39:56,746 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:39:56,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,750 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:39:56,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:39:56,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:39:56,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:39:56,753 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:39:56,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:39:56,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:39:56,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:39:56,754 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:39:56,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:39:56,755 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:39:56,758 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:39:56,759 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:39:56,760 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:39:56,761 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:39:56,761 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:39:56,761 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-11-15 23:39:56,763 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:39:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:56,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:39:56,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:39:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:56,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:39:56,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:39:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:56,884 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:39:56,884 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 129 transitions. cyclomatic complexity: 38 Second operand 3 states. [2019-11-15 23:39:56,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 129 transitions. cyclomatic complexity: 38. Second operand 3 states. Result 156 states and 231 transitions. Complement of second has 4 states. [2019-11-15 23:39:56,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:39:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:39:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2019-11-15 23:39:56,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 129 transitions. Stem has 28 letters. Loop has 23 letters. [2019-11-15 23:39:56,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:39:56,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 129 transitions. Stem has 51 letters. Loop has 23 letters. [2019-11-15 23:39:56,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:39:56,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 129 transitions. Stem has 28 letters. Loop has 46 letters. [2019-11-15 23:39:56,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:39:56,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 231 transitions. [2019-11-15 23:39:56,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:39:56,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 0 states and 0 transitions. [2019-11-15 23:39:56,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:39:56,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:39:56,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:39:56,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:39:56,940 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:39:56,940 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:39:56,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:56,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:39:56,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:39:56,941 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-15 23:39:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:56,941 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 23:39:56,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:39:56,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 23:39:56,942 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:39:56,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:39:56,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:39:56,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:39:56,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:39:56,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:39:56,942 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:39:56,942 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:39:56,942 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:39:56,942 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:39:56,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:39:56,943 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:39:56,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:39:56,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:39:56 BoogieIcfgContainer [2019-11-15 23:39:56,949 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:39:56,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:39:56,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:39:56,950 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:39:56,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:39:52" (3/4) ... [2019-11-15 23:39:56,953 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:39:56,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:39:56,955 INFO L168 Benchmark]: Toolchain (without parser) took 5510.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 950.1 MB in the beginning and 879.9 MB in the end (delta: 70.3 MB). Peak memory consumption was 274.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:39:56,955 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:39:56,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:39:56,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:39:56,957 INFO L168 Benchmark]: Boogie Preprocessor took 33.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:39:56,957 INFO L168 Benchmark]: RCFGBuilder took 633.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:39:56,958 INFO L168 Benchmark]: BuchiAutomizer took 4333.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.0 GB in the beginning and 879.9 MB in the end (delta: 168.8 MB). Peak memory consumption was 255.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:39:56,958 INFO L168 Benchmark]: Witness Printer took 3.98 ms. Allocated memory is still 1.2 GB. Free memory is still 879.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:39:56,961 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 442.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 633.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4333.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.0 GB in the beginning and 879.9 MB in the end (delta: 168.8 MB). Peak memory consumption was 255.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.98 ms. Allocated memory is still 1.2 GB. Free memory is still 879.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 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 92 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 415 SDtfs, 230 SDslu, 770 SDs, 0 SdLazy, 22 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax118 hnf104 lsp17 ukn86 mio100 lsp100 div127 bol100 ite100 ukn100 eq178 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms 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...