./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.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-2e94e6a [2019-01-02 00:08:39,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:08:39,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:08:39,534 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:08:39,534 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:08:39,535 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:08:39,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:08:39,539 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:08:39,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:08:39,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:08:39,543 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:08:39,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:08:39,544 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:08:39,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:08:39,547 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:08:39,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:08:39,548 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:08:39,551 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:08:39,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:08:39,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:08:39,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:08:39,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:08:39,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:08:39,561 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:08:39,561 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:08:39,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:08:39,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:08:39,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:08:39,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:08:39,567 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:08:39,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:08:39,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:08:39,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:08:39,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:08:39,573 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:08:39,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:08:39,575 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:08:39,613 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:08:39,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:08:39,615 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:08:39,615 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:08:39,615 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:08:39,615 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:08:39,616 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:08:39,616 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:08:39,616 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:08:39,616 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:08:39,616 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:08:39,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:08:39,620 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:08:39,620 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:08:39,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:08:39,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:08:39,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:08:39,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:08:39,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:08:39,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:08:39,622 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:08:39,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:08:39,622 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:08:39,622 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:08:39,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:08:39,627 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:08:39,628 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:08:39,628 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:08:39,628 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:08:39,628 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:08:39,628 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:08:39,630 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:08:39,631 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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-01-02 00:08:39,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:08:39,709 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:08:39,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:08:39,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:08:39,718 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:08:39,719 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:08:39,787 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627d44f92/7721cd3c361a47079291d65dc1f4f59e/FLAG1c7bdd63e [2019-01-02 00:08:40,288 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:08:40,289 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:08:40,305 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627d44f92/7721cd3c361a47079291d65dc1f4f59e/FLAG1c7bdd63e [2019-01-02 00:08:40,595 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627d44f92/7721cd3c361a47079291d65dc1f4f59e [2019-01-02 00:08:40,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:08:40,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:08:40,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:40,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:08:40,606 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:08:40,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:40,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443c6e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40, skipping insertion in model container [2019-01-02 00:08:40,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:40,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:08:40,656 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:08:40,904 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:40,914 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:08:40,961 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:40,984 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:08:40,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40 WrapperNode [2019-01-02 00:08:40,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:40,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:40,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:08:40,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:08:40,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:41,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:41,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:41,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:08:41,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:08:41,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:08:41,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:41,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:41,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:41,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:41,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:41,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:41,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (1/1) ... [2019-01-02 00:08:41,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:08:41,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:08:41,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:08:41,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:08:41,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (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-01-02 00:08:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:08:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:08:42,043 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:08:42,043 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-02 00:08:42,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:42 BoogieIcfgContainer [2019-01-02 00:08:42,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:08:42,045 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:08:42,045 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:08:42,048 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:08:42,049 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:42,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:08:40" (1/3) ... [2019-01-02 00:08:42,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@669f8675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:42, skipping insertion in model container [2019-01-02 00:08:42,051 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:42,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:40" (2/3) ... [2019-01-02 00:08:42,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@669f8675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:42, skipping insertion in model container [2019-01-02 00:08:42,052 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:42,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:42" (3/3) ... [2019-01-02 00:08:42,054 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:08:42,112 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:08:42,112 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:08:42,113 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:08:42,113 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:08:42,113 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:08:42,113 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:08:42,113 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:08:42,114 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:08:42,114 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:08:42,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2019-01-02 00:08:42,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-01-02 00:08:42,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:42,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:42,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:42,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:42,167 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:08:42,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2019-01-02 00:08:42,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-01-02 00:08:42,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:42,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:42,177 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:42,177 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:42,184 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-01-02 00:08:42,185 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-01-02 00:08:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash 28791078, now seen corresponding path program 1 times [2019-01-02 00:08:42,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:42,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:42,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:42,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:42,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:42,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:42,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:42,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:08:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1766040228, now seen corresponding path program 1 times [2019-01-02 00:08:42,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:42,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:42,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:42,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:42,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:42,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:42,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:42,685 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:42,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:08:42,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:08:42,712 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-01-02 00:08:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:43,117 INFO L93 Difference]: Finished difference Result 78 states and 124 transitions. [2019-01-02 00:08:43,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:08:43,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 124 transitions. [2019-01-02 00:08:43,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:08:43,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 101 transitions. [2019-01-02 00:08:43,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-01-02 00:08:43,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-02 00:08:43,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 101 transitions. [2019-01-02 00:08:43,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:43,135 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-01-02 00:08:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 101 transitions. [2019-01-02 00:08:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-02 00:08:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-02 00:08:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2019-01-02 00:08:43,178 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-01-02 00:08:43,178 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-01-02 00:08:43,179 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:08:43,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 101 transitions. [2019-01-02 00:08:43,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:08:43,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:43,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:43,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:43,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:43,184 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-01-02 00:08:43,185 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-01-02 00:08:43,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 1 times [2019-01-02 00:08:43,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:43,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:43,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:43,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:43,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1766040228, now seen corresponding path program 2 times [2019-01-02 00:08:43,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:43,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:43,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:43,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:43,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:43,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:43,393 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:43,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:08:43,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:08:43,394 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. cyclomatic complexity: 31 Second operand 5 states. [2019-01-02 00:08:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:43,524 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-01-02 00:08:43,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:08:43,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-01-02 00:08:43,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:08:43,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 99 transitions. [2019-01-02 00:08:43,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-01-02 00:08:43,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-02 00:08:43,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2019-01-02 00:08:43,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:43,545 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-02 00:08:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2019-01-02 00:08:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-02 00:08:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-02 00:08:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-01-02 00:08:43,557 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-02 00:08:43,558 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-02 00:08:43,558 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:08:43,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2019-01-02 00:08:43,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:08:43,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:43,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:43,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:43,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:43,563 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-01-02 00:08:43,563 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-01-02 00:08:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 2 times [2019-01-02 00:08:43,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:43,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:43,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1470655047, now seen corresponding path program 1 times [2019-01-02 00:08:43,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:43,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1996203394, now seen corresponding path program 1 times [2019-01-02 00:08:43,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:43,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:43,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:43,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:43,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:43,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:44,539 WARN L181 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-01-02 00:08:45,407 WARN L181 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-01-02 00:08:45,439 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:45,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:45,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:45,441 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:45,441 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:08:45,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:45,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:45,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:45,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:08:45,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:45,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:45,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:45,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,031 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:08:46,460 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2019-01-02 00:08:46,573 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:46,573 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:46,578 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:46,578 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:46,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:08:46,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:46,709 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:08:46,711 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:46,712 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:46,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:46,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:46,712 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:08:46,712 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:46,712 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:46,712 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:46,712 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_true-unreach-call.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:08:46,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:46,713 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:46,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,905 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-02 00:08:46,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:46,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:47,537 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:08:47,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:47,820 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:08:47,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:47,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:47,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:47,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:47,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:47,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:47,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:47,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:47,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:47,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:47,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:47,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:47,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:47,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:47,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:47,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:47,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:47,846 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:08:47,851 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:08:47,852 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:08:47,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:08:47,860 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:08:47,860 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:08:47,861 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-01-02 00:08:47,864 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:08:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:47,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:48,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:48,174 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-01-02 00:08:48,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-01-02 00:08:48,244 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-01-02 00:08:48,245 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-01-02 00:08:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:08:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2019-01-02 00:08:48,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 21 letters. Loop has 19 letters. [2019-01-02 00:08:48,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:48,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 40 letters. Loop has 19 letters. [2019-01-02 00:08:48,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:48,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 21 letters. Loop has 38 letters. [2019-01-02 00:08:48,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:48,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 178 transitions. [2019-01-02 00:08:48,254 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:48,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 0 states and 0 transitions. [2019-01-02 00:08:48,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:08:48,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:08:48,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:08:48,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:48,255 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:48,255 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:48,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:08:48,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:08:48,255 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-02 00:08:48,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:48,255 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:08:48,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:08:48,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:08:48,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:48,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:08:48,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:08:48,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:08:48,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:08:48,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:48,257 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:48,257 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:48,257 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:48,257 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:08:48,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:08:48,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:48,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:08:48,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:08:48 BoogieIcfgContainer [2019-01-02 00:08:48,265 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:08:48,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:08:48,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:08:48,266 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:08:48,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:42" (3/4) ... [2019-01-02 00:08:48,270 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:08:48,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:08:48,271 INFO L168 Benchmark]: Toolchain (without parser) took 7672.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -86.6 MB). Peak memory consumption was 121.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:48,273 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:08:48,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.14 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:48,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:48,278 INFO L168 Benchmark]: Boogie Preprocessor took 35.49 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:48,279 INFO L168 Benchmark]: RCFGBuilder took 891.61 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.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:48,282 INFO L168 Benchmark]: BuchiAutomizer took 6220.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 123.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:48,283 INFO L168 Benchmark]: Witness Printer took 5.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:08:48,291 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.14 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 130.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.49 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 891.61 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.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6220.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 123.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 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 6.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. 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.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital215 mio100 ax117 hnf104 lsp22 ukn65 mio100 lsp100 div173 bol100 ite100 ukn100 eq151 hnf74 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms 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...