./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7ec78bcf477493ed3d3d8f07f2c43f18a2cf41d6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:48:15,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:48:15,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:48:15,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:48:15,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:48:15,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:48:15,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:48:15,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:48:15,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:48:15,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:48:15,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:48:15,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:48:15,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:48:15,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:48:15,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:48:15,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:48:15,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:48:15,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:48:15,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:48:15,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:48:15,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:48:15,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:48:15,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:48:15,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:48:15,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:48:15,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:48:15,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:48:15,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:48:15,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:48:15,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:48:15,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:48:15,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:48:15,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:48:15,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:48:15,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:48:15,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:48:15,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:48:15,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:48:15,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:48:15,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:48:15,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:48:15,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:48:15,585 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:48:15,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:48:15,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:48:15,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:48:15,587 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:48:15,587 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:48:15,588 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:48:15,588 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:48:15,589 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:48:15,589 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:48:15,590 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:48:15,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:48:15,591 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:48:15,591 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:48:15,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:48:15,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:48:15,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:48:15,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:48:15,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:48:15,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:48:15,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:48:15,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:48:15,597 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:48:15,598 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:48:15,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:48:15,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:48:15,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:48:15,600 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:48:15,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:48:15,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:48:15,601 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:48:15,603 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:48:15,603 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7ec78bcf477493ed3d3d8f07f2c43f18a2cf41d6 [2019-11-28 03:48:15,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:48:15,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:48:15,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:48:15,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:48:15,940 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:48:15,941 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2019-11-28 03:48:16,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d23266c3/ca81ec1d2db94f74bb2b3969aceb8d2f/FLAG885fa3980 [2019-11-28 03:48:16,505 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:48:16,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2019-11-28 03:48:16,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d23266c3/ca81ec1d2db94f74bb2b3969aceb8d2f/FLAG885fa3980 [2019-11-28 03:48:16,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d23266c3/ca81ec1d2db94f74bb2b3969aceb8d2f [2019-11-28 03:48:16,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:48:16,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:48:16,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:48:16,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:48:16,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:48:16,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:48:16" (1/1) ... [2019-11-28 03:48:16,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3463e911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:16, skipping insertion in model container [2019-11-28 03:48:16,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:48:16" (1/1) ... [2019-11-28 03:48:16,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:48:16,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:48:17,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:48:17,182 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:48:17,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:48:17,308 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:48:17,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17 WrapperNode [2019-11-28 03:48:17,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:48:17,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:48:17,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:48:17,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:48:17,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... [2019-11-28 03:48:17,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... [2019-11-28 03:48:17,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:48:17,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:48:17,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:48:17,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:48:17,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... [2019-11-28 03:48:17,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... [2019-11-28 03:48:17,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... [2019-11-28 03:48:17,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... [2019-11-28 03:48:17,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... [2019-11-28 03:48:17,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... [2019-11-28 03:48:17,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... [2019-11-28 03:48:17,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:48:17,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:48:17,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:48:17,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:48:17,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:48:17,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:48:17,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:48:18,024 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:48:18,025 INFO L297 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-28 03:48:18,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:48:18 BoogieIcfgContainer [2019-11-28 03:48:18,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:48:18,027 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:48:18,027 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:48:18,032 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:48:18,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:48:18,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:48:16" (1/3) ... [2019-11-28 03:48:18,035 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14a3c22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:48:18, skipping insertion in model container [2019-11-28 03:48:18,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:48:18,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:48:17" (2/3) ... [2019-11-28 03:48:18,036 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14a3c22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:48:18, skipping insertion in model container [2019-11-28 03:48:18,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:48:18,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:48:18" (3/3) ... [2019-11-28 03:48:18,038 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2019-11-28 03:48:18,085 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:48:18,086 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:48:18,086 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:48:18,086 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:48:18,088 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:48:18,088 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:48:18,088 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:48:18,088 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:48:18,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2019-11-28 03:48:18,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-11-28 03:48:18,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:48:18,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:48:18,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:48:18,148 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:48:18,148 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:48:18,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2019-11-28 03:48:18,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-11-28 03:48:18,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:48:18,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:48:18,170 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:48:18,170 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:48:18,179 INFO L794 eck$LassoCheckResult]: Stem: 36#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;~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]; 15#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~ret22, main_#t~ret23, main_#t~post24, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~alive1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive3~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 40#L205true assume !(0 == ~r1~0);init_~tmp~0 := 0; 37#L205-1true init_#res := init_~tmp~0; 10#L274true main_#t~ret22 := init_#res;main_~i2~0 := main_#t~ret22;havoc main_#t~ret22;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;main_~i2~0 := 0; 17#L329-2true [2019-11-28 03:48:18,181 INFO L796 eck$LassoCheckResult]: Loop: 17#L329-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 8#L102true 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 35#L106true assume !(node1_~m1~0 != ~nomsg~0); 13#L106-1true ~mode1~0 := 0; 24#L102-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 53#L137true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 58#L140true assume !(node2_~m2~0 != ~nomsg~0); 57#L140-1true ~mode2~0 := 0; 49#L137-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 16#L171true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 76#L174true assume !(node3_~m3~0 != ~nomsg~0); 75#L174-1true ~mode3~0 := 0; 70#L171-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 26#L282true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 43#L282-1true check_#res := check_~tmp~1; 47#L294true main_#t~ret23 := check_#res;main_~c1~0 := main_#t~ret23;havoc main_#t~ret23;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 67#L353true assume !(0 == assert_~arg % 256); 39#L348true main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 17#L329-2true [2019-11-28 03:48:18,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:48:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash 28791078, now seen corresponding path program 1 times [2019-11-28 03:48:18,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:48:18,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525766498] [2019-11-28 03:48:18,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:48:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:48:18,383 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-28 03:48:18,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525766498] [2019-11-28 03:48:18,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:48:18,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:48:18,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887625434] [2019-11-28 03:48:18,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:48:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:48:18,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1766040228, now seen corresponding path program 1 times [2019-11-28 03:48:18,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:48:18,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666589021] [2019-11-28 03:48:18,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:48:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:48:18,547 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-28 03:48:18,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666589021] [2019-11-28 03:48:18,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:48:18,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:48:18,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183507243] [2019-11-28 03:48:18,550 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:48:18,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:48:18,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:48:18,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:48:18,568 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-28 03:48:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:48:18,644 INFO L93 Difference]: Finished difference Result 78 states and 124 transitions. [2019-11-28 03:48:18,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:48:18,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 124 transitions. [2019-11-28 03:48:18,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-11-28 03:48:18,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 101 transitions. [2019-11-28 03:48:18,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-11-28 03:48:18,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-11-28 03:48:18,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 101 transitions. [2019-11-28 03:48:18,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:48:18,659 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-11-28 03:48:18,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 101 transitions. [2019-11-28 03:48:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 03:48:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 03:48:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2019-11-28 03:48:18,694 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-11-28 03:48:18,695 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-11-28 03:48:18,695 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:48:18,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 101 transitions. [2019-11-28 03:48:18,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-11-28 03:48:18,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:48:18,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:48:18,698 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] [2019-11-28 03:48:18,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:48:18,699 INFO L794 eck$LassoCheckResult]: Stem: 218#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;~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]; 193#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~ret22, main_#t~ret23, main_#t~post24, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~alive1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive3~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 194#L205 assume 0 == ~r1~0; 222#L206 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 237#L207 assume ~id1~0 >= 0; 174#L208 assume 0 == ~st1~0; 175#L209 assume ~send1~0 == ~id1~0; 211#L210 assume 0 == ~mode1~0 % 256; 230#L211 assume ~id2~0 >= 0; 191#L212 assume 0 == ~st2~0; 192#L213 assume ~send2~0 == ~id2~0; 234#L214 assume 0 == ~mode2~0 % 256; 198#L215 assume ~id3~0 >= 0; 199#L216 assume 0 == ~st3~0; 223#L217 assume ~send3~0 == ~id3~0; 238#L218 assume 0 == ~mode3~0 % 256; 178#L219 assume ~id1~0 != ~id2~0; 179#L220 assume ~id1~0 != ~id3~0; 213#L221 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 219#L205-1 init_#res := init_~tmp~0; 184#L274 main_#t~ret22 := init_#res;main_~i2~0 := main_#t~ret22;havoc main_#t~ret22;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;main_~i2~0 := 0; 185#L329-2 [2019-11-28 03:48:18,699 INFO L796 eck$LassoCheckResult]: Loop: 185#L329-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 180#L102 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 182#L106 assume !(node1_~m1~0 != ~nomsg~0); 189#L106-1 ~mode1~0 := 0; 190#L102-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 205#L137 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 232#L140 assume !(node2_~m2~0 != ~nomsg~0); 203#L140-1 ~mode2~0 := 0; 177#L137-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 195#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 197#L174 assume !(node3_~m3~0 != ~nomsg~0); 171#L174-1 ~mode3~0 := 0; 215#L171-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 208#L282 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 209#L282-1 check_#res := check_~tmp~1; 224#L294 main_#t~ret23 := check_#res;main_~c1~0 := main_#t~ret23;havoc main_#t~ret23;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 227#L353 assume !(0 == assert_~arg % 256); 220#L348 main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 185#L329-2 [2019-11-28 03:48:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:48:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 1 times [2019-11-28 03:48:18,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:48:18,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251123045] [2019-11-28 03:48:18,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:48:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:48:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:48:18,796 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:48:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:48:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1766040228, now seen corresponding path program 2 times [2019-11-28 03:48:18,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:48:18,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213917965] [2019-11-28 03:48:18,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:48:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:48:18,939 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-28 03:48:18,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213917965] [2019-11-28 03:48:18,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:48:18,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:48:18,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296227645] [2019-11-28 03:48:18,941 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:48:18,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:48:18,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:48:18,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:48:18,942 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. cyclomatic complexity: 31 Second operand 5 states. [2019-11-28 03:48:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:48:19,016 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-11-28 03:48:19,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:48:19,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-11-28 03:48:19,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-11-28 03:48:19,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 99 transitions. [2019-11-28 03:48:19,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-11-28 03:48:19,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-11-28 03:48:19,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2019-11-28 03:48:19,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:48:19,023 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-28 03:48:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2019-11-28 03:48:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 03:48:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 03:48:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-11-28 03:48:19,029 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-28 03:48:19,029 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-28 03:48:19,030 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:48:19,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2019-11-28 03:48:19,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-11-28 03:48:19,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:48:19,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:48:19,033 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] [2019-11-28 03:48:19,033 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] [2019-11-28 03:48:19,034 INFO L794 eck$LassoCheckResult]: Stem: 375#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;~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]; 350#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~ret22, main_#t~ret23, main_#t~post24, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~alive1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive3~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 351#L205 assume 0 == ~r1~0; 379#L206 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 394#L207 assume ~id1~0 >= 0; 331#L208 assume 0 == ~st1~0; 332#L209 assume ~send1~0 == ~id1~0; 367#L210 assume 0 == ~mode1~0 % 256; 387#L211 assume ~id2~0 >= 0; 348#L212 assume 0 == ~st2~0; 349#L213 assume ~send2~0 == ~id2~0; 391#L214 assume 0 == ~mode2~0 % 256; 355#L215 assume ~id3~0 >= 0; 356#L216 assume 0 == ~st3~0; 380#L217 assume ~send3~0 == ~id3~0; 395#L218 assume 0 == ~mode3~0 % 256; 333#L219 assume ~id1~0 != ~id2~0; 334#L220 assume ~id1~0 != ~id3~0; 368#L221 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 376#L205-1 init_#res := init_~tmp~0; 341#L274 main_#t~ret22 := init_#res;main_~i2~0 := main_#t~ret22;havoc main_#t~ret22;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;main_~i2~0 := 0; 342#L329-2 [2019-11-28 03:48:19,034 INFO L796 eck$LassoCheckResult]: Loop: 342#L329-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 337#L102 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 339#L106 assume !(node1_~m1~0 != ~nomsg~0); 346#L106-1 ~mode1~0 := 0; 347#L102-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 362#L137 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 389#L140 assume !(node2_~m2~0 != ~nomsg~0); 360#L140-1 ~mode2~0 := 0; 336#L137-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 352#L171 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 354#L174 assume !(node3_~m3~0 != ~nomsg~0); 328#L174-1 ~mode3~0 := 0; 371#L171-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 365#L282 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 366#L283 assume ~r1~0 < 3;check_~tmp~1 := 1; 373#L282-1 check_#res := check_~tmp~1; 381#L294 main_#t~ret23 := check_#res;main_~c1~0 := main_#t~ret23;havoc main_#t~ret23;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 384#L353 assume !(0 == assert_~arg % 256); 378#L348 main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 342#L329-2 [2019-11-28 03:48:19,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:48:19,035 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 2 times [2019-11-28 03:48:19,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:48:19,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386232327] [2019-11-28 03:48:19,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:48:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:48:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:48:19,092 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:48:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:48:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1470655047, now seen corresponding path program 1 times [2019-11-28 03:48:19,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:48:19,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189886128] [2019-11-28 03:48:19,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:48:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:48:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:48:19,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:48:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:48:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1996203394, now seen corresponding path program 1 times [2019-11-28 03:48:19,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:48:19,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716018107] [2019-11-28 03:48:19,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:48:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:48:19,245 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-28 03:48:19,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716018107] [2019-11-28 03:48:19,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:48:19,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:48:19,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225093502] [2019-11-28 03:48:19,562 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-11-28 03:48:20,203 WARN L192 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-11-28 03:48:20,219 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:48:20,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:48:20,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:48:20,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:48:20,221 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:48:20,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:48:20,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:48:20,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:48:20,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration3_Loop [2019-11-28 03:48:20,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:48:20,222 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:48:20,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-28 03:48:20,269 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-28 03:48:20,275 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-28 03:48:20,282 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-28 03:48:20,286 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-28 03:48:20,288 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-28 03:48:20,290 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-28 03:48:20,298 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-28 03:48:20,300 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-28 03:48:20,306 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-28 03:48:20,309 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-28 03:48:20,312 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-28 03:48:20,348 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-28 03:48:20,351 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-28 03:48:20,356 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-28 03:48:20,358 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-28 03:48:20,382 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-28 03:48:20,384 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-28 03:48:20,389 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-28 03:48:20,391 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-28 03:48:20,392 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-28 03:48:20,395 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-28 03:48:20,398 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-28 03:48:20,979 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:48:20,980 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:48:20,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:48:20,995 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 03:48:21,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:48:21,025 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-28 03:48:21,157 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:48:21,160 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:48:21,160 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:48:21,160 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:48:21,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:48:21,161 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:48:21,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:48:21,161 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:48:21,161 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:48:21,161 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration3_Loop [2019-11-28 03:48:21,161 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:48:21,161 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:48:21,168 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-28 03:48:21,177 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-28 03:48:21,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-28 03:48:21,188 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-28 03:48:21,191 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-28 03:48:21,192 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-28 03:48:21,199 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-28 03:48:21,200 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-28 03:48:21,203 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-28 03:48:21,208 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-28 03:48:21,209 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-28 03:48:21,215 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-28 03:48:21,221 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-28 03:48:21,223 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-28 03:48:21,225 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-28 03:48:21,263 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-28 03:48:21,265 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-28 03:48:21,289 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-28 03:48:21,296 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-28 03:48:21,298 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-28 03:48:21,300 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-28 03:48:21,303 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-28 03:48:21,306 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-28 03:48:21,756 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:48:21,761 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:48:21,773 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-28 03:48:21,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:48:21,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:48:21,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:48:21,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:48:21,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:48:21,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:48:21,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:48:21,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:48:21,798 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-28 03:48:21,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:48:21,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:48:21,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:48:21,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:48:21,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:48:21,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:48:21,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:48:21,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:48:21,828 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:48:21,829 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:48:21,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:48:21,835 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:48:21,835 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:48:21,836 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-11-28 03:48:21,840 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:48:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:48:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:48:21,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:48:21,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:48:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:48:22,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:48:22,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:48:22,026 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-28 03:48:22,033 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-28 03:48:22,034 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-11-28 03:48:22,088 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 99 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 121 states and 178 transitions. Complement of second has 4 states. [2019-11-28 03:48:22,089 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-28 03:48:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:48:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2019-11-28 03:48:22,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 21 letters. Loop has 19 letters. [2019-11-28 03:48:22,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:48:22,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 40 letters. Loop has 19 letters. [2019-11-28 03:48:22,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:48:22,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 21 letters. Loop has 38 letters. [2019-11-28 03:48:22,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:48:22,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 178 transitions. [2019-11-28 03:48:22,100 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:48:22,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 0 states and 0 transitions. [2019-11-28 03:48:22,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:48:22,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:48:22,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:48:22,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:48:22,104 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:48:22,104 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:48:22,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:48:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:48:22,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:48:22,107 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-28 03:48:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:48:22,107 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 03:48:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:48:22,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 03:48:22,109 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:48:22,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 03:48:22,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:48:22,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:48:22,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:48:22,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:48:22,112 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:48:22,112 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:48:22,112 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:48:22,112 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:48:22,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:48:22,113 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:48:22,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:48:22,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:48:22 BoogieIcfgContainer [2019-11-28 03:48:22,122 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:48:22,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:48:22,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:48:22,125 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:48:22,126 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:48:18" (3/4) ... [2019-11-28 03:48:22,130 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:48:22,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:48:22,133 INFO L168 Benchmark]: Toolchain (without parser) took 5279.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 961.7 MB in the beginning and 996.7 MB in the end (delta: -35.0 MB). Peak memory consumption was 180.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:48:22,134 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:48:22,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:48:22,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:48:22,144 INFO L168 Benchmark]: Boogie Preprocessor took 60.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:48:22,145 INFO L168 Benchmark]: RCFGBuilder took 607.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:48:22,146 INFO L168 Benchmark]: BuchiAutomizer took 4095.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 100.8 MB). Peak memory consumption was 168.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:48:22,147 INFO L168 Benchmark]: Witness Printer took 6.36 ms. Allocated memory is still 1.2 GB. Free memory is still 996.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:48:22,159 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 453.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 607.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4095.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 100.8 MB). Peak memory consumption was 168.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.36 ms. Allocated memory is still 1.2 GB. Free memory is still 996.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 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.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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 71 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 318 SDtfs, 177 SDslu, 590 SDs, 0 SdLazy, 22 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital215 mio100 ax117 hnf104 lsp22 ukn65 mio100 lsp100 div168 bol100 ite100 ukn100 eq153 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 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...