./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.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_false-unreach-call.1.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 abf77f97875b3c7e87b90b0cc41c08fea68d8fc2 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:34,390 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:08:34,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:08:34,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:08:34,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:08:34,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:08:34,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:08:34,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:08:34,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:08:34,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:08:34,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:08:34,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:08:34,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:08:34,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:08:34,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:08:34,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:08:34,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:08:34,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:08:34,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:08:34,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:08:34,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:08:34,465 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:08:34,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:08:34,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:08:34,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:08:34,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:08:34,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:08:34,478 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:08:34,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:08:34,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:08:34,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:08:34,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:08:34,482 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:08:34,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:08:34,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:08:34,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:08:34,485 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:34,507 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:08:34,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:08:34,508 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:08:34,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:08:34,509 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:08:34,509 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:08:34,509 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:08:34,510 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:08:34,510 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:08:34,510 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:08:34,510 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:08:34,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:08:34,510 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:08:34,511 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:08:34,511 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:08:34,511 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:08:34,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:08:34,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:08:34,512 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:08:34,512 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:08:34,512 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:08:34,512 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:08:34,512 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:08:34,512 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:08:34,513 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:08:34,513 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:08:34,513 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:08:34,513 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:08:34,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:08:34,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:08:34,514 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:08:34,515 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:08:34,515 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 -> abf77f97875b3c7e87b90b0cc41c08fea68d8fc2 [2019-01-02 00:08:34,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:08:34,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:08:34,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:08:34,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:08:34,588 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:08:34,588 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:08:34,648 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4e34002/dba05a6d0ff44cbf8d74edd2af70b5e9/FLAG0f98b4657 [2019-01-02 00:08:35,145 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:08:35,146 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:08:35,166 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4e34002/dba05a6d0ff44cbf8d74edd2af70b5e9/FLAG0f98b4657 [2019-01-02 00:08:35,432 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4e34002/dba05a6d0ff44cbf8d74edd2af70b5e9 [2019-01-02 00:08:35,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:08:35,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:08:35,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:35,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:08:35,443 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:08:35,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:35" (1/1) ... [2019-01-02 00:08:35,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b06401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:35, skipping insertion in model container [2019-01-02 00:08:35,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:35" (1/1) ... [2019-01-02 00:08:35,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:08:35,513 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:08:35,844 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:35,854 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:08:35,918 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:35,948 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:08:35,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:35 WrapperNode [2019-01-02 00:08:35,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:35,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:35,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:08:35,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:08:35,959 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:35" (1/1) ... [2019-01-02 00:08:35,968 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:35" (1/1) ... [2019-01-02 00:08:36,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:36,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:08:36,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:08:36,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:08:36,086 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:35" (1/1) ... [2019-01-02 00:08:36,086 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:35" (1/1) ... [2019-01-02 00:08:36,090 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:35" (1/1) ... [2019-01-02 00:08:36,090 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:35" (1/1) ... [2019-01-02 00:08:36,097 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:35" (1/1) ... [2019-01-02 00:08:36,105 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:35" (1/1) ... [2019-01-02 00:08:36,108 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:35" (1/1) ... [2019-01-02 00:08:36,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:08:36,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:08:36,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:08:36,113 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:08:36,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:35" (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:36,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:08:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:08:37,162 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:08:37,162 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-02 00:08:37,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:37 BoogieIcfgContainer [2019-01-02 00:08:37,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:08:37,164 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:08:37,164 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:08:37,167 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:08:37,168 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:37,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:08:35" (1/3) ... [2019-01-02 00:08:37,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55e157c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:37, skipping insertion in model container [2019-01-02 00:08:37,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:37,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:35" (2/3) ... [2019-01-02 00:08:37,170 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55e157c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:37, skipping insertion in model container [2019-01-02 00:08:37,170 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:37,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:37" (3/3) ... [2019-01-02 00:08:37,172 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2019-01-02 00:08:37,231 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:08:37,232 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:08:37,232 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:08:37,232 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:08:37,233 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:08:37,233 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:08:37,233 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:08:37,233 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:08:37,233 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:08:37,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2019-01-02 00:08:37,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-01-02 00:08:37,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:37,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:37,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:37,290 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:37,290 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:08:37,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2019-01-02 00:08:37,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-01-02 00:08:37,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:37,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:37,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:37,298 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:37,307 INFO L794 eck$LassoCheckResult]: Stem: 37#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]; 14#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; 61#L207true assume !(0 == ~r1~0);init_~tmp~0 := 0; 76#L207-1true init_#res := init_~tmp~0; 52#L276true 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; 54#L331-2true [2019-01-02 00:08:37,308 INFO L796 eck$LassoCheckResult]: Loop: 54#L331-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; 6#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; 36#L106true assume !(node1_~m1~0 != ~nomsg~0); 11#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; 39#L139true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 23#L142true assume !(node2_~m2~0 != ~nomsg~0); 21#L142-1true ~mode2~0 := 0; 12#L139-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 59#L173true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 27#L176true assume !(node3_~m3~0 != ~nomsg~0); 26#L176-1true ~mode3~0 := 0; 58#L173-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; 66#L284true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 64#L284-1true check_#res := check_~tmp~1; 9#L296true 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; 28#L355true assume !(0 == assert_~arg % 256); 73#L350true main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 54#L331-2true [2019-01-02 00:08:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash 28791078, now seen corresponding path program 1 times [2019-01-02 00:08:37,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:37,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:37,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:37,553 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:37,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:37,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:37,560 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:08:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1766040228, now seen corresponding path program 1 times [2019-01-02 00:08:37,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:37,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:37,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:37,733 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:37,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:37,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:37,736 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:37,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:08:37,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:08:37,759 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-01-02 00:08:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:37,913 INFO L93 Difference]: Finished difference Result 78 states and 124 transitions. [2019-01-02 00:08:37,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:08:37,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 124 transitions. [2019-01-02 00:08:37,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:08:37,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 101 transitions. [2019-01-02 00:08:37,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-01-02 00:08:37,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-02 00:08:37,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 101 transitions. [2019-01-02 00:08:37,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:37,940 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-01-02 00:08:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 101 transitions. [2019-01-02 00:08:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-02 00:08:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-02 00:08:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2019-01-02 00:08:37,987 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-01-02 00:08:37,987 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 101 transitions. [2019-01-02 00:08:37,988 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:08:37,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 101 transitions. [2019-01-02 00:08:37,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:08:37,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:37,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:37,994 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:37,994 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:37,995 INFO L794 eck$LassoCheckResult]: Stem: 222#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]; 195#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; 196#L207 assume 0 == ~r1~0; 169#L208 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 170#L209 assume ~id1~0 >= 0; 212#L210 assume 0 == ~st1~0; 229#L211 assume ~send1~0 == ~id1~0; 191#L212 assume 0 == ~mode1~0 % 256; 192#L213 assume ~id2~0 >= 0; 233#L214 assume 0 == ~st2~0; 200#L215 assume ~send2~0 == ~id2~0; 201#L216 assume 0 == ~mode2~0 % 256; 224#L217 assume ~id3~0 >= 0; 236#L218 assume 0 == ~st3~0; 173#L219 assume ~send3~0 == ~id3~0; 174#L220 assume 0 == ~mode3~0 % 256; 213#L221 assume ~id1~0 != ~id2~0; 230#L222 assume ~id1~0 != ~id3~0; 218#L223 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 219#L207-1 init_#res := init_~tmp~0; 231#L276 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; 232#L331-2 [2019-01-02 00:08:37,995 INFO L796 eck$LassoCheckResult]: Loop: 232#L331-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; 175#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; 177#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#L139 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 203#L142 assume !(node2_~m2~0 != ~nomsg~0); 202#L142-1 ~mode2~0 := 0; 187#L139-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 188#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 208#L176 assume !(node3_~m3~0 != ~nomsg~0); 207#L176-1 ~mode3~0 := 0; 194#L173-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; 234#L284 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 180#L284-1 check_#res := check_~tmp~1; 182#L296 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; 183#L355 assume !(0 == assert_~arg % 256); 210#L350 main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 232#L331-2 [2019-01-02 00:08:37,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 1 times [2019-01-02 00:08:37,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:37,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:38,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:38,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:38,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1766040228, now seen corresponding path program 2 times [2019-01-02 00:08:38,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:38,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:38,232 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:38,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:38,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:38,233 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:08:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:08:38,235 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. cyclomatic complexity: 31 Second operand 5 states. [2019-01-02 00:08:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:38,400 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-01-02 00:08:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:08:38,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-01-02 00:08:38,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:08:38,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 99 transitions. [2019-01-02 00:08:38,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-01-02 00:08:38,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-02 00:08:38,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2019-01-02 00:08:38,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:38,407 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-02 00:08:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2019-01-02 00:08:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-02 00:08:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-02 00:08:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-01-02 00:08:38,414 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-02 00:08:38,414 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-01-02 00:08:38,414 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:08:38,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2019-01-02 00:08:38,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:08:38,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:38,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:38,417 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:38,417 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:38,418 INFO L794 eck$LassoCheckResult]: Stem: 379#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]; 352#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; 353#L207 assume 0 == ~r1~0; 326#L208 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 327#L209 assume ~id1~0 >= 0; 369#L210 assume 0 == ~st1~0; 386#L211 assume ~send1~0 == ~id1~0; 348#L212 assume 0 == ~mode1~0 % 256; 349#L213 assume ~id2~0 >= 0; 390#L214 assume 0 == ~st2~0; 357#L215 assume ~send2~0 == ~id2~0; 358#L216 assume 0 == ~mode2~0 % 256; 381#L217 assume ~id3~0 >= 0; 393#L218 assume 0 == ~st3~0; 328#L219 assume ~send3~0 == ~id3~0; 329#L220 assume 0 == ~mode3~0 % 256; 370#L221 assume ~id1~0 != ~id2~0; 387#L222 assume ~id1~0 != ~id3~0; 375#L223 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 376#L207-1 init_#res := init_~tmp~0; 388#L276 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; 389#L331-2 [2019-01-02 00:08:38,418 INFO L796 eck$LassoCheckResult]: Loop: 389#L331-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; 332#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; 334#L106 assume !(node1_~m1~0 != ~nomsg~0); 344#L106-1 ~mode1~0 := 0; 345#L102-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 362#L139 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 360#L142 assume !(node2_~m2~0 != ~nomsg~0); 359#L142-1 ~mode2~0 := 0; 346#L139-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 347#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 365#L176 assume !(node3_~m3~0 != ~nomsg~0); 364#L176-1 ~mode3~0 := 0; 351#L173-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; 392#L284 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 336#L285 assume ~r1~0 < 3;check_~tmp~1 := 1; 337#L284-1 check_#res := check_~tmp~1; 339#L296 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; 340#L355 assume !(0 == assert_~arg % 256); 367#L350 main_#t~post24 := main_~i2~0;main_~i2~0 := 1 + main_#t~post24;havoc main_#t~post24; 389#L331-2 [2019-01-02 00:08:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash -47575204, now seen corresponding path program 2 times [2019-01-02 00:08:38,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:38,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:38,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:38,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1470655047, now seen corresponding path program 1 times [2019-01-02 00:08:38,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:38,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:38,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:38,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1996203394, now seen corresponding path program 1 times [2019-01-02 00:08:38,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:38,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:38,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:38,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:38,656 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:38,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:38,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:39,401 WARN L181 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-01-02 00:08:40,365 WARN L181 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-01-02 00:08:40,396 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:40,398 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:40,398 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:40,398 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:40,398 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:08:40,398 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:40,399 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:40,399 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:40,399 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:08:40,399 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:40,399 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:40,431 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:40,449 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:40,457 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:40,472 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:40,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:40,479 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:40,482 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:40,493 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:40,497 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:40,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:40,529 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:40,538 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:40,585 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:40,588 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:40,594 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:40,614 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:40,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:40,662 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:40,673 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:40,675 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:40,677 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:40,680 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:40,682 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:41,397 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2019-01-02 00:08:41,507 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:41,507 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:41,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:41,514 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:41,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:08:41,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:41,658 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:08:41,660 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:41,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:41,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:41,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:41,661 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:08:41,661 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:41,661 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:41,661 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:41,661 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:08:41,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:41,662 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:41,668 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:41,681 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:41,690 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:41,703 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:41,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:41,709 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:41,717 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:41,720 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:41,722 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:41,725 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:41,728 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:41,735 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:41,741 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:41,743 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:41,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:41,892 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-02 00:08:41,893 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:41,921 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:42,047 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:08:42,048 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:42,053 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:42,054 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:42,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:42,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:42,064 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:42,506 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:08:42,784 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:08:42,809 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:42,822 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:08:42,825 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:42,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:42,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:42,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:42,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:42,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:42,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:42,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:42,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:42,840 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:42,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:42,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:42,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:42,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:42,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:42,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:42,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:42,845 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:08:42,849 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:08:42,849 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:08:42,852 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:08:42,852 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:08:42,852 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:08:42,853 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:42,854 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:08:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:42,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:42,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:43,008 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,015 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:43,015 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-01-02 00:08:43,080 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:43,081 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:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:08:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2019-01-02 00:08:43,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 21 letters. Loop has 19 letters. [2019-01-02 00:08:43,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:43,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 40 letters. Loop has 19 letters. [2019-01-02 00:08:43,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:43,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 21 letters. Loop has 38 letters. [2019-01-02 00:08:43,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:43,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 178 transitions. [2019-01-02 00:08:43,090 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:43,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 0 states and 0 transitions. [2019-01-02 00:08:43,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:08:43,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:08:43,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:08:43,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:43,091 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:43,091 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:43,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:08:43,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:08:43,092 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-02 00:08:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:43,092 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:08:43,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:08:43,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:08:43,092 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:43,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:08:43,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:08:43,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:08:43,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:08:43,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:43,093 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:43,093 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:43,093 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:43,093 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:08:43,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:08:43,094 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:43,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:08:43,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:08:43 BoogieIcfgContainer [2019-01-02 00:08:43,101 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:08:43,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:08:43,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:08:43,102 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:08:43,103 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:37" (3/4) ... [2019-01-02 00:08:43,106 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:08:43,107 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:08:43,108 INFO L168 Benchmark]: Toolchain (without parser) took 7671.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -87.9 MB). Peak memory consumption was 120.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:43,109 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:08:43,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.50 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 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:43,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:43,111 INFO L168 Benchmark]: Boogie Preprocessor took 36.50 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:43,112 INFO L168 Benchmark]: RCFGBuilder took 1050.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: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:43,113 INFO L168 Benchmark]: BuchiAutomizer took 5937.65 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 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:43,114 INFO L168 Benchmark]: Witness Printer took 5.10 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:43,119 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 510.50 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 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 125.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -199.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.50 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1050.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: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5937.65 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 1.0 GB in the end (delta: 57.3 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.10 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 5.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.1s. Construction of modules took 0.1s. 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.1s 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: 15ms 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...