./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.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.5_false-unreach-call.1.ufo.BOUNDED-10.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 6191f76ca1968cb0b63f42b60887059af617e3ab ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:09:04,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:09:04,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:09:04,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:09:04,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:09:04,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:09:04,419 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:09:04,420 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:09:04,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:09:04,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:09:04,424 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:09:04,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:09:04,425 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:09:04,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:09:04,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:09:04,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:09:04,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:09:04,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:09:04,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:09:04,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:09:04,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:09:04,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:09:04,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:09:04,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:09:04,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:09:04,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:09:04,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:09:04,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:09:04,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:09:04,444 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:09:04,444 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:09:04,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:09:04,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:09:04,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:09:04,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:09:04,448 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:09:04,448 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:09:04,474 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:09:04,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:09:04,476 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:09:04,476 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:09:04,477 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:09:04,477 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:09:04,477 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:09:04,477 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:09:04,477 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:09:04,479 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:09:04,479 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:09:04,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:09:04,479 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:09:04,479 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:09:04,479 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:09:04,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:09:04,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:09:04,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:09:04,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:09:04,481 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:09:04,481 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:09:04,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:09:04,481 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:09:04,482 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:09:04,482 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:09:04,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:09:04,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:09:04,482 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:09:04,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:09:04,486 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:09:04,486 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:09:04,487 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:09:04,488 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 -> 6191f76ca1968cb0b63f42b60887059af617e3ab [2019-01-02 00:09:04,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:09:04,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:09:04,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:09:04,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:09:04,551 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:09:04,551 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2019-01-02 00:09:04,611 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52b54be1/33965c7ea47b497dbd0fcc3f16564f6d/FLAGc53ee061a [2019-01-02 00:09:05,119 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:09:05,121 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2019-01-02 00:09:05,135 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52b54be1/33965c7ea47b497dbd0fcc3f16564f6d/FLAGc53ee061a [2019-01-02 00:09:05,382 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52b54be1/33965c7ea47b497dbd0fcc3f16564f6d [2019-01-02 00:09:05,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:09:05,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:09:05,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:09:05,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:09:05,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:09:05,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:09:05" (1/1) ... [2019-01-02 00:09:05,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a354ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05, skipping insertion in model container [2019-01-02 00:09:05,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:09:05" (1/1) ... [2019-01-02 00:09:05,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:09:05,458 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:09:05,819 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:09:05,837 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:09:05,902 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:09:05,923 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:09:05,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05 WrapperNode [2019-01-02 00:09:05,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:09:05,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:09:05,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:09:05,925 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:09:05,998 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:09:05" (1/1) ... [2019-01-02 00:09:06,009 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:09:05" (1/1) ... [2019-01-02 00:09:06,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:09:06,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:09:06,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:09:06,051 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:09:06,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05" (1/1) ... [2019-01-02 00:09:06,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05" (1/1) ... [2019-01-02 00:09:06,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05" (1/1) ... [2019-01-02 00:09:06,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05" (1/1) ... [2019-01-02 00:09:06,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05" (1/1) ... [2019-01-02 00:09:06,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05" (1/1) ... [2019-01-02 00:09:06,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05" (1/1) ... [2019-01-02 00:09:06,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:09:06,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:09:06,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:09:06,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:09:06,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05" (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:09:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:09:06,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:09:07,165 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:09:07,165 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-02 00:09:07,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:07 BoogieIcfgContainer [2019-01-02 00:09:07,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:09:07,168 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:09:07,168 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:09:07,171 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:09:07,172 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:07,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:09:05" (1/3) ... [2019-01-02 00:09:07,173 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c4a32f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:09:07, skipping insertion in model container [2019-01-02 00:09:07,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:07,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:09:05" (2/3) ... [2019-01-02 00:09:07,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c4a32f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:09:07, skipping insertion in model container [2019-01-02 00:09:07,174 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:09:07,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:07" (3/3) ... [2019-01-02 00:09:07,176 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2019-01-02 00:09:07,232 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:09:07,233 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:09:07,233 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:09:07,233 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:09:07,234 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:09:07,234 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:09:07,234 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:09:07,234 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:09:07,234 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:09:07,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2019-01-02 00:09:07,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-01-02 00:09:07,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:07,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:07,315 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:09:07,315 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:07,316 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:09:07,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2019-01-02 00:09:07,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-01-02 00:09:07,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:07,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:07,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:09:07,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:07,335 INFO L794 eck$LassoCheckResult]: Stem: 44#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 14#L-1true havoc main_#res;havoc main_#t~nondet5, 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~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 32#L242true assume !(0 == ~r1~0);init_~tmp~0 := 0; 30#L242-1true init_#res := init_~tmp~0; 76#L367true main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 39#L439-2true [2019-01-02 00:09:07,336 INFO L796 eck$LassoCheckResult]: Loop: 39#L439-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 7#L113true assume !(0 != ~mode1~0 % 256); 71#L129true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 67#L129-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 3#L113-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 89#L141true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 59#L144true assume !(node2_~m2~0 != ~nomsg~0); 55#L144-1true ~mode2~0 := 0; 86#L141-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 61#L166true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 40#L169true assume !(node3_~m3~0 != ~nomsg~0); 35#L169-1true ~mode3~0 := 0; 77#L166-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 68#L191true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 49#L194true assume !(node4_~m4~0 != ~nomsg~0); 48#L194-1true ~mode4~0 := 0; 34#L191-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 51#L216true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 5#L219true assume !(node5_~m5~0 != ~nomsg~0); 4#L219-1true ~mode5~0 := 0; 47#L216-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 82#L375true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 83#L375-1true check_#res := check_~tmp~1; 37#L395true main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 64#L469true assume !(0 == assert_~arg % 256); 25#L464true main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 39#L439-2true [2019-01-02 00:09:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash 28874490, now seen corresponding path program 1 times [2019-01-02 00:09:07,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:07,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:07,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:07,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:07,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:07,629 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:09:07,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:07,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:07,639 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:09:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:07,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2097075120, now seen corresponding path program 1 times [2019-01-02 00:09:07,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:07,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:07,801 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:09:07,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:07,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:09:07,804 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:07,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:09:07,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:09:07,824 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2019-01-02 00:09:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:08,082 INFO L93 Difference]: Finished difference Result 92 states and 152 transitions. [2019-01-02 00:09:08,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:09:08,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 152 transitions. [2019-01-02 00:09:08,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:09:08,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 85 states and 115 transitions. [2019-01-02 00:09:08,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2019-01-02 00:09:08,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2019-01-02 00:09:08,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 115 transitions. [2019-01-02 00:09:08,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:08,108 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2019-01-02 00:09:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 115 transitions. [2019-01-02 00:09:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-02 00:09:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-02 00:09:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2019-01-02 00:09:08,145 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2019-01-02 00:09:08,146 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2019-01-02 00:09:08,146 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:09:08,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 115 transitions. [2019-01-02 00:09:08,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:09:08,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:08,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:08,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:08,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:08,156 INFO L794 eck$LassoCheckResult]: Stem: 256#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 217#L-1 havoc main_#res;havoc main_#t~nondet5, 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~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 218#L242 assume 0 == ~r1~0; 244#L243 assume ~id1~0 >= 0; 273#L244 assume 0 == ~st1~0; 254#L245 assume ~send1~0 == ~id1~0; 255#L246 assume 0 == ~mode1~0 % 256; 277#L247 assume ~id2~0 >= 0; 228#L248 assume 0 == ~st2~0; 229#L249 assume ~send2~0 == ~id2~0; 265#L250 assume 0 == ~mode2~0 % 256; 268#L251 assume ~id3~0 >= 0; 211#L252 assume 0 == ~st3~0; 212#L253 assume ~send3~0 == ~id3~0; 246#L254 assume 0 == ~mode3~0 % 256; 219#L255 assume ~id4~0 >= 0; 220#L256 assume 0 == ~st4~0; 257#L257 assume ~send4~0 == ~id4~0; 278#L258 assume 0 == ~mode4~0 % 256; 232#L259 assume ~id5~0 >= 0; 233#L260 assume 0 == ~st5~0; 266#L261 assume ~send5~0 == ~id5~0; 269#L262 assume 0 == ~mode5~0 % 256; 213#L263 assume ~id1~0 != ~id2~0; 214#L264 assume ~id1~0 != ~id3~0; 247#L265 assume ~id1~0 != ~id4~0; 221#L266 assume ~id1~0 != ~id5~0; 222#L267 assume ~id2~0 != ~id3~0; 258#L268 assume ~id2~0 != ~id4~0; 279#L269 assume ~id2~0 != ~id5~0; 234#L270 assume ~id3~0 != ~id4~0; 235#L271 assume ~id3~0 != ~id5~0; 236#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 241#L242-1 init_#res := init_~tmp~0; 242#L367 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 231#L439-2 [2019-01-02 00:09:08,156 INFO L796 eck$LassoCheckResult]: Loop: 231#L439-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 206#L113 assume !(0 != ~mode1~0 % 256); 208#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 275#L129-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 197#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 198#L141 assume !(0 != ~mode2~0 % 256); 237#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 238#L154-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 262#L141-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 272#L166 assume !(0 != ~mode3~0 % 256); 215#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 209#L179-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 210#L166-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 276#L191 assume !(0 != ~mode4~0 % 256); 225#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 223#L204-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 224#L191-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 245#L216 assume !(0 != ~mode5~0 % 256); 263#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 281#L229-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 200#L216-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 259#L375 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 226#L375-1 check_#res := check_~tmp~1; 249#L395 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 250#L469 assume !(0 == assert_~arg % 256); 230#L464 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 231#L439-2 [2019-01-02 00:09:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 1 times [2019-01-02 00:09:08,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:08,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:08,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:08,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:08,322 INFO L82 PathProgramCache]: Analyzing trace with hash 219355176, now seen corresponding path program 1 times [2019-01-02 00:09:08,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:08,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:08,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:08,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:08,481 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:09:08,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:08,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:09:08,483 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:09:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:09:08,484 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. cyclomatic complexity: 31 Second operand 5 states. [2019-01-02 00:09:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:08,611 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2019-01-02 00:09:08,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:09:08,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 117 transitions. [2019-01-02 00:09:08,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:09:08,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 85 states and 112 transitions. [2019-01-02 00:09:08,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2019-01-02 00:09:08,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2019-01-02 00:09:08,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 112 transitions. [2019-01-02 00:09:08,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:08,620 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-01-02 00:09:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 112 transitions. [2019-01-02 00:09:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-02 00:09:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-02 00:09:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2019-01-02 00:09:08,627 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-01-02 00:09:08,628 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-01-02 00:09:08,628 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:09:08,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 112 transitions. [2019-01-02 00:09:08,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-01-02 00:09:08,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:08,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:08,631 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:08,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:08,632 INFO L794 eck$LassoCheckResult]: Stem: 441#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 402#L-1 havoc main_#res;havoc main_#t~nondet5, 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~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 403#L242 assume 0 == ~r1~0; 429#L243 assume ~id1~0 >= 0; 458#L244 assume 0 == ~st1~0; 438#L245 assume ~send1~0 == ~id1~0; 439#L246 assume 0 == ~mode1~0 % 256; 462#L247 assume ~id2~0 >= 0; 413#L248 assume 0 == ~st2~0; 414#L249 assume ~send2~0 == ~id2~0; 449#L250 assume 0 == ~mode2~0 % 256; 453#L251 assume ~id3~0 >= 0; 396#L252 assume 0 == ~st3~0; 397#L253 assume ~send3~0 == ~id3~0; 430#L254 assume 0 == ~mode3~0 % 256; 404#L255 assume ~id4~0 >= 0; 405#L256 assume 0 == ~st4~0; 442#L257 assume ~send4~0 == ~id4~0; 463#L258 assume 0 == ~mode4~0 % 256; 415#L259 assume ~id5~0 >= 0; 416#L260 assume 0 == ~st5~0; 451#L261 assume ~send5~0 == ~id5~0; 454#L262 assume 0 == ~mode5~0 % 256; 398#L263 assume ~id1~0 != ~id2~0; 399#L264 assume ~id1~0 != ~id3~0; 432#L265 assume ~id1~0 != ~id4~0; 406#L266 assume ~id1~0 != ~id5~0; 407#L267 assume ~id2~0 != ~id3~0; 443#L268 assume ~id2~0 != ~id4~0; 464#L269 assume ~id2~0 != ~id5~0; 419#L270 assume ~id3~0 != ~id4~0; 420#L271 assume ~id3~0 != ~id5~0; 421#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 426#L242-1 init_#res := init_~tmp~0; 427#L367 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 418#L439-2 [2019-01-02 00:09:08,633 INFO L796 eck$LassoCheckResult]: Loop: 418#L439-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 391#L113 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 392#L117 assume !(node1_~m1~0 != ~nomsg~0); 401#L117-1 ~mode1~0 := 0; 382#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 383#L141 assume !(0 != ~mode2~0 % 256); 422#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 423#L154-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 447#L141-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 457#L166 assume !(0 != ~mode3~0 % 256); 400#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 394#L179-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 395#L166-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 461#L191 assume !(0 != ~mode4~0 % 256); 410#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 408#L204-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 409#L191-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 431#L216 assume !(0 != ~mode5~0 % 256); 448#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 466#L229-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 385#L216-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 444#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 388#L376 assume ~r1~0 >= 5; 389#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 411#L375-1 check_#res := check_~tmp~1; 434#L395 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 435#L469 assume !(0 == assert_~arg % 256); 417#L464 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 418#L439-2 [2019-01-02 00:09:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:08,633 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 2 times [2019-01-02 00:09:08,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:08,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:08,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1823427134, now seen corresponding path program 1 times [2019-01-02 00:09:08,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:08,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:08,796 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:09:08,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:08,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:08,797 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:08,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:09:08,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:09:08,798 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-01-02 00:09:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:08,885 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2019-01-02 00:09:08,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:09:08,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 178 transitions. [2019-01-02 00:09:08,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2019-01-02 00:09:08,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 178 transitions. [2019-01-02 00:09:08,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-01-02 00:09:08,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-01-02 00:09:08,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 178 transitions. [2019-01-02 00:09:08,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:08,902 INFO L705 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2019-01-02 00:09:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 178 transitions. [2019-01-02 00:09:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-02 00:09:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-02 00:09:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2019-01-02 00:09:08,920 INFO L728 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2019-01-02 00:09:08,920 INFO L608 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2019-01-02 00:09:08,920 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:09:08,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 178 transitions. [2019-01-02 00:09:08,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2019-01-02 00:09:08,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:08,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:08,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:08,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:08,934 INFO L794 eck$LassoCheckResult]: Stem: 661#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 622#L-1 havoc main_#res;havoc main_#t~nondet5, 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~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 623#L242 assume 0 == ~r1~0; 648#L243 assume ~id1~0 >= 0; 679#L244 assume 0 == ~st1~0; 658#L245 assume ~send1~0 == ~id1~0; 659#L246 assume 0 == ~mode1~0 % 256; 683#L247 assume ~id2~0 >= 0; 632#L248 assume 0 == ~st2~0; 633#L249 assume ~send2~0 == ~id2~0; 670#L250 assume 0 == ~mode2~0 % 256; 673#L251 assume ~id3~0 >= 0; 615#L252 assume 0 == ~st3~0; 616#L253 assume ~send3~0 == ~id3~0; 650#L254 assume 0 == ~mode3~0 % 256; 624#L255 assume ~id4~0 >= 0; 625#L256 assume 0 == ~st4~0; 662#L257 assume ~send4~0 == ~id4~0; 684#L258 assume 0 == ~mode4~0 % 256; 636#L259 assume ~id5~0 >= 0; 637#L260 assume 0 == ~st5~0; 671#L261 assume ~send5~0 == ~id5~0; 674#L262 assume 0 == ~mode5~0 % 256; 617#L263 assume ~id1~0 != ~id2~0; 618#L264 assume ~id1~0 != ~id3~0; 654#L265 assume ~id1~0 != ~id4~0; 628#L266 assume ~id1~0 != ~id5~0; 629#L267 assume ~id2~0 != ~id3~0; 663#L268 assume ~id2~0 != ~id4~0; 685#L269 assume ~id2~0 != ~id5~0; 638#L270 assume ~id3~0 != ~id4~0; 639#L271 assume ~id3~0 != ~id5~0; 640#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 645#L242-1 init_#res := init_~tmp~0; 646#L367 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 687#L439-2 [2019-01-02 00:09:08,934 INFO L796 eck$LassoCheckResult]: Loop: 687#L439-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 724#L113 assume !(0 != ~mode1~0 % 256); 723#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 722#L129-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 621#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 721#L141 assume !(0 != ~mode2~0 % 256); 720#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 719#L154-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 718#L141-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 717#L166 assume !(0 != ~mode3~0 % 256); 713#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 711#L179-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 710#L166-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 709#L191 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 707#L194 assume !(node4_~m4~0 != ~nomsg~0); 703#L194-1 ~mode4~0 := 0; 702#L191-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 701#L216 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 699#L219 assume !(node5_~m5~0 != ~nomsg~0); 695#L219-1 ~mode5~0 := 0; 694#L216-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 693#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 692#L376 assume !(~r1~0 >= 5); 690#L379 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 691#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 730#L375-1 check_#res := check_~tmp~1; 729#L395 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 728#L469 assume !(0 == assert_~arg % 256); 727#L464 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 687#L439-2 [2019-01-02 00:09:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:08,935 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 3 times [2019-01-02 00:09:08,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:08,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:08,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:08,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1664257150, now seen corresponding path program 1 times [2019-01-02 00:09:09,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:09,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:09,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:09,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:09,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:09,083 INFO L82 PathProgramCache]: Analyzing trace with hash -241790386, now seen corresponding path program 1 times [2019-01-02 00:09:09,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:09,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:09,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:09,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:09,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:09,240 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:09:09,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:09,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:10,011 WARN L181 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2019-01-02 00:09:13,594 WARN L181 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 145 DAG size of output: 134 [2019-01-02 00:09:13,608 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:13,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:13,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:13,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:13,609 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:09:13,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:13,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:13,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:13,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2019-01-02 00:09:13,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:13,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:13,633 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-02 00:09:13,822 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:09:13,892 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:09:13,930 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:09:13,963 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:09:13,968 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:09:13,976 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:09:13,978 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:09:13,982 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:09:13,984 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:09:13,996 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:09:14,366 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-01-02 00:09:14,366 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:09:14,369 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:09:14,372 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:09:14,375 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:09:14,376 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:09:14,381 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:09:14,390 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:09:14,397 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:09:14,400 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:09:14,403 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:09:14,405 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:09:14,408 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:09:14,413 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:09:14,416 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:09:14,422 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:09:14,426 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:09:14,428 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:09:14,432 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:09:14,917 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-02 00:09:15,066 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-02 00:09:15,420 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-02 00:10:05,225 WARN L181 SmtUtils]: Spent 49.58 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2019-01-02 00:10:05,400 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:10:05,401 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:10:05,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:10:05,412 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) [2019-01-02 00:10:05,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:10:05,463 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:05,643 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:10:05,646 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:10:05,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:10:05,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:10:05,647 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:10:05,647 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:10:05,647 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:10:05,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:10:05,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:10:05,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2019-01-02 00:10:05,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:10:05,649 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:10:05,656 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-02 00:10:05,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:10:05,827 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:10:05,859 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:10:05,899 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:10:05,925 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:10:05,960 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:10:06,050 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:10:06,090 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:10:06,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:06,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:10:06,231 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:10:06,822 WARN L181 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-01-02 00:10:06,822 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:10:06,824 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:10:06,825 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:10:06,827 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:10:06,836 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:10:06,840 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:10:06,842 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:10:06,844 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:10:06,848 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:10:06,852 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:10:06,855 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:10:06,857 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:10:06,858 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:10:06,866 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:10:06,894 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:10:06,897 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:10:06,899 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:10:07,309 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-02 00:10:07,416 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-02 00:10:57,614 WARN L181 SmtUtils]: Spent 49.95 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2019-01-02 00:10:57,784 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:10:57,790 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:10:57,792 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:10:57,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:57,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:57,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:57,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,806 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:10:57,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:57,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:57,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,814 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:10:57,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:57,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:57,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:57,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,820 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:10:57,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:57,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:57,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:57,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,827 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:10:57,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:57,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:57,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,836 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:10:57,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:57,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:57,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:57,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,843 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:10:57,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:57,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:57,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,852 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:10:57,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:57,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:57,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:57,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,859 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:10:57,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:57,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:57,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:57,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,861 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:10:57,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:57,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:57,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:57,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:57,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:57,873 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:10:57,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:57,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:57,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:57,876 INFO L206 nArgumentSynthesizer]: 64 loop disjuncts [2019-01-02 00:10:57,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,077 INFO L402 nArgumentSynthesizer]: We have 128 Motzkin's Theorem applications. [2019-01-02 00:10:58,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,724 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:10:58,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,731 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:10:58,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,738 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:10:58,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:10:58,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:10:58,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,746 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:10:58,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:10:58,758 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:10:58,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:10:58,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:10:58,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:10:58,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:10:58,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:10:58,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:10:58,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:10:58,765 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:10:58,770 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:10:58,772 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:10:58,774 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:10:58,775 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:10:58,776 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:10:58,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2019-01-02 00:10:58,779 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:10:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:10:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:10:59,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:10:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:10:59,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:10:59,386 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:10:59,395 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:10:59,396 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 178 transitions. cyclomatic complexity: 50 Second operand 3 states. [2019-01-02 00:10:59,539 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 178 transitions. cyclomatic complexity: 50. Second operand 3 states. Result 222 states and 321 transitions. Complement of second has 4 states. [2019-01-02 00:10:59,542 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:10:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:10:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2019-01-02 00:10:59,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 35 letters. Loop has 29 letters. [2019-01-02 00:10:59,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:10:59,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 64 letters. Loop has 29 letters. [2019-01-02 00:10:59,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:10:59,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 35 letters. Loop has 58 letters. [2019-01-02 00:10:59,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:10:59,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 321 transitions. [2019-01-02 00:10:59,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:10:59,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 0 states and 0 transitions. [2019-01-02 00:10:59,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:10:59,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:10:59,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:10:59,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:10:59,559 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:10:59,559 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:10:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:10:59,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:10:59,563 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-02 00:10:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:10:59,563 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:10:59,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:10:59,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:10:59,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:10:59,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:10:59,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:10:59,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:10:59,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:10:59,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:10:59,566 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:10:59,566 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:10:59,566 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:10:59,566 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:10:59,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:10:59,566 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:10:59,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:10:59,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:10:59 BoogieIcfgContainer [2019-01-02 00:10:59,578 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:10:59,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:10:59,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:10:59,578 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:10:59,581 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:09:07" (3/4) ... [2019-01-02 00:10:59,588 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:10:59,589 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:10:59,590 INFO L168 Benchmark]: Toolchain (without parser) took 114204.08 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 518.0 MB). Free memory was 947.3 MB in the beginning and 824.6 MB in the end (delta: 122.8 MB). Peak memory consumption was 640.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:10:59,593 INFO L168 Benchmark]: CDTParser took 0.17 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:10:59,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.00 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 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:10:59,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:10:59,598 INFO L168 Benchmark]: Boogie Preprocessor took 39.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:10:59,598 INFO L168 Benchmark]: RCFGBuilder took 1076.39 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: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:10:59,601 INFO L168 Benchmark]: BuchiAutomizer took 112409.94 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.1 GB in the beginning and 824.6 MB in the end (delta: 270.1 MB). Peak memory consumption was 642.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:10:59,602 INFO L168 Benchmark]: Witness Printer took 11.18 ms. Allocated memory is still 1.5 GB. Free memory is still 824.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:10:59,610 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.17 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 536.00 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 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 126.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1076.39 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: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 112409.94 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.1 GB in the beginning and 824.6 MB in the end (delta: 270.1 MB). Peak memory consumption was 642.4 MB. Max. memory is 11.5 GB. * Witness Printer took 11.18 ms. Allocated memory is still 1.5 GB. Free memory is still 824.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 112.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 110.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 129 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 543 SDtfs, 178 SDslu, 775 SDs, 0 SdLazy, 32 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital1394 mio100 ax104 hnf100 lsp14 ukn65 mio100 lsp100 div172 bol100 ite100 ukn100 eq166 hnf67 smp100 dnf40036 smp11 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 845ms VariablesStem: 0 VariablesLoop: 32 DisjunctsStem: 1 DisjunctsLoop: 64 SupportingInvariants: 0 MotzkinApplications: 128 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...