./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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.6_false-unreach-call.1.ufo.BOUNDED-12.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 bd200d2db4e8741128c4082e326a133517d9c82f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:47:39,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:47:39,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:47:39,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:47:39,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:47:39,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:47:39,345 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:47:39,347 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:47:39,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:47:39,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:47:39,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:47:39,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:47:39,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:47:39,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:47:39,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:47:39,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:47:39,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:47:39,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:47:39,366 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:47:39,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:47:39,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:47:39,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:47:39,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:47:39,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:47:39,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:47:39,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:47:39,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:47:39,384 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:47:39,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:47:39,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:47:39,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:47:39,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:47:39,389 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:47:39,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:47:39,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:47:39,394 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:47:39,395 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:47:39,422 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:47:39,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:47:39,423 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:47:39,424 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:47:39,424 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:47:39,424 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:47:39,424 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:47:39,424 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:47:39,425 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:47:39,425 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:47:39,425 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:47:39,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:47:39,425 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:47:39,426 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:47:39,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:47:39,427 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:47:39,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:47:39,428 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:47:39,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:47:39,428 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:47:39,428 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:47:39,429 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:47:39,429 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:47:39,429 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:47:39,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:47:39,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:47:39,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:47:39,430 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:47:39,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:47:39,430 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:47:39,430 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:47:39,433 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:47:39,433 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 -> bd200d2db4e8741128c4082e326a133517d9c82f [2019-01-14 04:47:39,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:47:39,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:47:39,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:47:39,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:47:39,486 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:47:39,487 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2019-01-14 04:47:39,541 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/115ffdffa/0cae95b28c4f48cea2eb9f33405ea387/FLAG5dc9fa556 [2019-01-14 04:47:39,984 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:47:39,984 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2019-01-14 04:47:39,995 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/115ffdffa/0cae95b28c4f48cea2eb9f33405ea387/FLAG5dc9fa556 [2019-01-14 04:47:40,323 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/115ffdffa/0cae95b28c4f48cea2eb9f33405ea387 [2019-01-14 04:47:40,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:47:40,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:47:40,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:40,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:47:40,332 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:47:40,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9334c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40, skipping insertion in model container [2019-01-14 04:47:40,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:47:40,398 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:47:40,643 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:40,654 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:47:40,732 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:40,755 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:47:40,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40 WrapperNode [2019-01-14 04:47:40,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:40,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:40,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:47:40,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:47:40,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:40,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:47:40,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:47:40,894 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:47:40,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... [2019-01-14 04:47:40,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:47:40,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:47:40,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:47:40,931 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:47:40,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:47:41,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:47:42,017 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:47:42,018 INFO L286 CfgBuilder]: Removed 23 assue(true) statements. [2019-01-14 04:47:42,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:42 BoogieIcfgContainer [2019-01-14 04:47:42,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:47:42,020 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:47:42,020 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:47:42,023 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:47:42,023 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:42,024 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:47:40" (1/3) ... [2019-01-14 04:47:42,025 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a6ee51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:47:42, skipping insertion in model container [2019-01-14 04:47:42,025 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:42,025 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:40" (2/3) ... [2019-01-14 04:47:42,026 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a6ee51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:47:42, skipping insertion in model container [2019-01-14 04:47:42,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:42,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:42" (3/3) ... [2019-01-14 04:47:42,028 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2019-01-14 04:47:42,076 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:47:42,077 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:47:42,077 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:47:42,077 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:47:42,078 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:47:42,078 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:47:42,078 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:47:42,078 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:47:42,078 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:47:42,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2019-01-14 04:47:42,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-01-14 04:47:42,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:42,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:42,136 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:47:42,136 INFO L868 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, 1] [2019-01-14 04:47:42,136 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:47:42,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2019-01-14 04:47:42,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2019-01-14 04:47:42,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:42,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:42,147 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:47:42,148 INFO L868 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, 1] [2019-01-14 04:47:42,157 INFO L794 eck$LassoCheckResult]: Stem: 82#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 11#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 7#L274true assume !(0 == ~r1~0);init_~tmp~0 := 0; 5#L274-1true init_#res := init_~tmp~0; 64#L435true main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 39#L513-2true [2019-01-14 04:47:42,158 INFO L796 eck$LassoCheckResult]: Loop: 39#L513-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 19#L120true assume !(0 != ~mode1~0 % 256); 25#L136true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 23#L136-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; 17#L120-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 93#L148true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 96#L151true assume !(node2_~m2~0 != ~nomsg~0); 95#L151-1true ~mode2~0 := 0; 92#L148-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 98#L173true assume !(0 != ~mode3~0 % 256); 3#L186true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 20#L186-2true ~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; 94#L173-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 75#L198true assume !(0 != ~mode4~0 % 256); 103#L211true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 102#L211-2true ~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; 88#L198-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 80#L223true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 68#L226true assume !(node5_~m5~0 != ~nomsg~0); 66#L226-1true ~mode5~0 := 0; 61#L223-2true havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 69#L248true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 48#L251true assume !(node6_~m6~0 != ~nomsg~0); 47#L251-1true ~mode6~0 := 0; 65#L248-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 86#L443true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 87#L443-1true check_#res := check_~tmp~1; 56#L463true main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 37#L546true assume !(0 == assert_~arg % 256); 18#L541true main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 39#L513-2true [2019-01-14 04:47:42,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:42,168 INFO L82 PathProgramCache]: Analyzing trace with hash 28928112, now seen corresponding path program 1 times [2019-01-14 04:47:42,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:42,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:42,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:42,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:42,491 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-14 04:47:42,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:42,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:42,501 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:47:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash -779821311, now seen corresponding path program 1 times [2019-01-14 04:47:42,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:42,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:42,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:42,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:42,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:42,826 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-14 04:47:42,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:42,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:47:42,829 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:47:42,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:47:42,846 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2019-01-14 04:47:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:43,044 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2019-01-14 04:47:43,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:47:43,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 183 transitions. [2019-01-14 04:47:43,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-01-14 04:47:43,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 102 states and 137 transitions. [2019-01-14 04:47:43,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-01-14 04:47:43,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2019-01-14 04:47:43,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 137 transitions. [2019-01-14 04:47:43,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:43,063 INFO L706 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2019-01-14 04:47:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 137 transitions. [2019-01-14 04:47:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 04:47:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 04:47:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2019-01-14 04:47:43,102 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2019-01-14 04:47:43,102 INFO L609 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2019-01-14 04:47:43,102 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:47:43,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 137 transitions. [2019-01-14 04:47:43,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-01-14 04:47:43,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:43,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:43,109 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:43,109 INFO L868 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, 1] [2019-01-14 04:47:43,110 INFO L794 eck$LassoCheckResult]: Stem: 327#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 248#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 240#L274 assume 0 == ~r1~0; 241#L275 assume ~id1~0 >= 0; 289#L276 assume 0 == ~st1~0; 249#L277 assume ~send1~0 == ~id1~0; 250#L278 assume 0 == ~mode1~0 % 256; 294#L279 assume ~id2~0 >= 0; 295#L280 assume 0 == ~st2~0; 320#L281 assume ~send2~0 == ~id2~0; 265#L282 assume 0 == ~mode2~0 % 256; 266#L283 assume ~id3~0 >= 0; 304#L284 assume 0 == ~st3~0; 242#L285 assume ~send3~0 == ~id3~0; 243#L286 assume 0 == ~mode3~0 % 256; 307#L287 assume ~id4~0 >= 0; 251#L288 assume 0 == ~st4~0; 252#L289 assume ~send4~0 == ~id4~0; 297#L290 assume 0 == ~mode4~0 % 256; 298#L291 assume ~id5~0 >= 0; 321#L292 assume 0 == ~st5~0; 267#L293 assume ~send5~0 == ~id5~0; 268#L294 assume 0 == ~mode5~0 % 256; 305#L295 assume ~id6~0 >= 0; 246#L296 assume 0 == ~st6~0; 247#L297 assume ~send6~0 == ~id6~0; 308#L298 assume 0 == ~mode6~0 % 256; 255#L299 assume ~id1~0 != ~id2~0; 256#L300 assume ~id1~0 != ~id3~0; 299#L301 assume ~id1~0 != ~id4~0; 300#L302 assume ~id1~0 != ~id5~0; 312#L303 assume ~id1~0 != ~id6~0; 280#L304 assume ~id2~0 != ~id3~0; 281#L305 assume ~id2~0 != ~id4~0; 309#L306 assume ~id2~0 != ~id5~0; 253#L307 assume ~id2~0 != ~id6~0; 254#L308 assume ~id3~0 != ~id4~0; 306#L309 assume ~id3~0 != ~id5~0; 244#L310 assume ~id3~0 != ~id6~0; 245#L311 assume ~id4~0 != ~id5~0; 283#L312 assume ~id4~0 != ~id6~0; 284#L313 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 235#L274-1 init_#res := init_~tmp~0; 236#L435 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 260#L513-2 [2019-01-14 04:47:43,111 INFO L796 eck$LassoCheckResult]: Loop: 260#L513-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 261#L120 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 262#L124 assume !(node1_~m1~0 != ~nomsg~0); 271#L124-1 ~mode1~0 := 0; 257#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 258#L148 assume !(0 != ~mode2~0 % 256); 277#L161 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 275#L161-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; 276#L148-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 329#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 322#L176 assume !(node3_~m3~0 != ~nomsg~0); 274#L176-1 ~mode3~0 := 0; 264#L173-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 323#L198 assume !(0 != ~mode4~0 % 256); 324#L211 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 331#L211-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; 315#L198-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 325#L223 assume !(0 != ~mode5~0 % 256); 326#L236 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 332#L236-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; 313#L223-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 314#L248 assume !(0 != ~mode6~0 % 256); 319#L261 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 328#L261-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 302#L248-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 317#L443 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 291#L443-1 check_#res := check_~tmp~1; 311#L463 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 288#L546 assume !(0 == assert_~arg % 256); 259#L541 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 260#L513-2 [2019-01-14 04:47:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:43,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 1 times [2019-01-14 04:47:43,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:43,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:43,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1583129737, now seen corresponding path program 1 times [2019-01-14 04:47:43,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:43,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:43,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:43,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:43,435 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-14 04:47:43,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:43,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:47:43,436 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:47:43,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:47:43,437 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. cyclomatic complexity: 36 Second operand 5 states. [2019-01-14 04:47:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:43,560 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2019-01-14 04:47:43,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:47:43,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 139 transitions. [2019-01-14 04:47:43,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-01-14 04:47:43,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 102 states and 134 transitions. [2019-01-14 04:47:43,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-01-14 04:47:43,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2019-01-14 04:47:43,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 134 transitions. [2019-01-14 04:47:43,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:43,571 INFO L706 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-01-14 04:47:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 134 transitions. [2019-01-14 04:47:43,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 04:47:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 04:47:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2019-01-14 04:47:43,579 INFO L729 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-01-14 04:47:43,579 INFO L609 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-01-14 04:47:43,579 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:47:43,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 134 transitions. [2019-01-14 04:47:43,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2019-01-14 04:47:43,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:43,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:43,584 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:43,585 INFO L868 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, 1, 1, 1] [2019-01-14 04:47:43,586 INFO L794 eck$LassoCheckResult]: Stem: 546#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 467#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 459#L274 assume 0 == ~r1~0; 460#L275 assume ~id1~0 >= 0; 508#L276 assume 0 == ~st1~0; 468#L277 assume ~send1~0 == ~id1~0; 469#L278 assume 0 == ~mode1~0 % 256; 512#L279 assume ~id2~0 >= 0; 513#L280 assume 0 == ~st2~0; 539#L281 assume ~send2~0 == ~id2~0; 484#L282 assume 0 == ~mode2~0 % 256; 485#L283 assume ~id3~0 >= 0; 523#L284 assume 0 == ~st3~0; 461#L285 assume ~send3~0 == ~id3~0; 462#L286 assume 0 == ~mode3~0 % 256; 526#L287 assume ~id4~0 >= 0; 470#L288 assume 0 == ~st4~0; 471#L289 assume ~send4~0 == ~id4~0; 515#L290 assume 0 == ~mode4~0 % 256; 516#L291 assume ~id5~0 >= 0; 540#L292 assume 0 == ~st5~0; 486#L293 assume ~send5~0 == ~id5~0; 487#L294 assume 0 == ~mode5~0 % 256; 524#L295 assume ~id6~0 >= 0; 465#L296 assume 0 == ~st6~0; 466#L297 assume ~send6~0 == ~id6~0; 527#L298 assume 0 == ~mode6~0 % 256; 474#L299 assume ~id1~0 != ~id2~0; 475#L300 assume ~id1~0 != ~id3~0; 517#L301 assume ~id1~0 != ~id4~0; 518#L302 assume ~id1~0 != ~id5~0; 531#L303 assume ~id1~0 != ~id6~0; 499#L304 assume ~id2~0 != ~id3~0; 500#L305 assume ~id2~0 != ~id4~0; 528#L306 assume ~id2~0 != ~id5~0; 472#L307 assume ~id2~0 != ~id6~0; 473#L308 assume ~id3~0 != ~id4~0; 525#L309 assume ~id3~0 != ~id5~0; 463#L310 assume ~id3~0 != ~id6~0; 464#L311 assume ~id4~0 != ~id5~0; 502#L312 assume ~id4~0 != ~id6~0; 503#L313 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 454#L274-1 init_#res := init_~tmp~0; 455#L435 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 479#L513-2 [2019-01-14 04:47:43,586 INFO L796 eck$LassoCheckResult]: Loop: 479#L513-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 480#L120 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 481#L124 assume !(node1_~m1~0 != ~nomsg~0); 490#L124-1 ~mode1~0 := 0; 476#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 477#L148 assume !(0 != ~mode2~0 % 256); 496#L161 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 494#L161-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; 495#L148-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 548#L173 assume !(0 != ~mode3~0 % 256); 450#L186 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 451#L186-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; 483#L173-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 542#L198 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 535#L201 assume !(node4_~m4~0 != ~nomsg~0); 498#L201-1 ~mode4~0 := 0; 534#L198-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 544#L223 assume !(0 != ~mode5~0 % 256); 545#L236 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 551#L236-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; 532#L223-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 533#L248 assume !(0 != ~mode6~0 % 256); 538#L261 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 547#L261-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 521#L248-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 536#L443 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 514#L444 assume ~r1~0 >= 6; 510#L448 assume ~r1~0 < 6;check_~tmp~1 := 1; 520#L443-1 check_#res := check_~tmp~1; 530#L463 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 507#L546 assume !(0 == assert_~arg % 256); 478#L541 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 479#L513-2 [2019-01-14 04:47:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 2 times [2019-01-14 04:47:43,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:43,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:43,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:43,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:43,679 INFO L82 PathProgramCache]: Analyzing trace with hash 360303399, now seen corresponding path program 1 times [2019-01-14 04:47:43,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:43,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:43,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:47:43,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:43,771 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-14 04:47:43,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:43,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:43,772 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:47:43,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:47:43,773 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. cyclomatic complexity: 33 Second operand 3 states. [2019-01-14 04:47:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:43,839 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2019-01-14 04:47:43,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:47:43,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 213 transitions. [2019-01-14 04:47:43,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2019-01-14 04:47:43,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 213 transitions. [2019-01-14 04:47:43,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-01-14 04:47:43,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2019-01-14 04:47:43,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 213 transitions. [2019-01-14 04:47:43,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:43,847 INFO L706 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-01-14 04:47:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 213 transitions. [2019-01-14 04:47:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-01-14 04:47:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 04:47:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-01-14 04:47:43,858 INFO L729 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-01-14 04:47:43,859 INFO L609 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-01-14 04:47:43,859 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:47:43,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 213 transitions. [2019-01-14 04:47:43,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2019-01-14 04:47:43,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:43,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:43,864 INFO L867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:43,864 INFO L868 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, 1, 1, 1, 1] [2019-01-14 04:47:43,864 INFO L794 eck$LassoCheckResult]: Stem: 811#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 729#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 721#L274 assume 0 == ~r1~0; 722#L275 assume ~id1~0 >= 0; 770#L276 assume 0 == ~st1~0; 730#L277 assume ~send1~0 == ~id1~0; 731#L278 assume 0 == ~mode1~0 % 256; 775#L279 assume ~id2~0 >= 0; 776#L280 assume 0 == ~st2~0; 804#L281 assume ~send2~0 == ~id2~0; 746#L282 assume 0 == ~mode2~0 % 256; 747#L283 assume ~id3~0 >= 0; 787#L284 assume 0 == ~st3~0; 723#L285 assume ~send3~0 == ~id3~0; 724#L286 assume 0 == ~mode3~0 % 256; 790#L287 assume ~id4~0 >= 0; 732#L288 assume 0 == ~st4~0; 733#L289 assume ~send4~0 == ~id4~0; 779#L290 assume 0 == ~mode4~0 % 256; 780#L291 assume ~id5~0 >= 0; 805#L292 assume 0 == ~st5~0; 748#L293 assume ~send5~0 == ~id5~0; 749#L294 assume 0 == ~mode5~0 % 256; 788#L295 assume ~id6~0 >= 0; 727#L296 assume 0 == ~st6~0; 728#L297 assume ~send6~0 == ~id6~0; 791#L298 assume 0 == ~mode6~0 % 256; 736#L299 assume ~id1~0 != ~id2~0; 737#L300 assume ~id1~0 != ~id3~0; 781#L301 assume ~id1~0 != ~id4~0; 782#L302 assume ~id1~0 != ~id5~0; 795#L303 assume ~id1~0 != ~id6~0; 761#L304 assume ~id2~0 != ~id3~0; 762#L305 assume ~id2~0 != ~id4~0; 792#L306 assume ~id2~0 != ~id5~0; 734#L307 assume ~id2~0 != ~id6~0; 735#L308 assume ~id3~0 != ~id4~0; 789#L309 assume ~id3~0 != ~id5~0; 725#L310 assume ~id3~0 != ~id6~0; 726#L311 assume ~id4~0 != ~id5~0; 764#L312 assume ~id4~0 != ~id6~0; 765#L313 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 716#L274-1 init_#res := init_~tmp~0; 717#L435 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 800#L513-2 [2019-01-14 04:47:43,865 INFO L796 eck$LassoCheckResult]: Loop: 800#L513-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 742#L120 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 743#L124 assume !(node1_~m1~0 != ~nomsg~0); 752#L124-1 ~mode1~0 := 0; 738#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 739#L148 assume !(0 != ~mode2~0 % 256); 758#L161 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 756#L161-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; 757#L148-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 814#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 806#L176 assume !(node3_~m3~0 != ~nomsg~0); 755#L176-1 ~mode3~0 := 0; 745#L173-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 807#L198 assume !(0 != ~mode4~0 % 256); 808#L211 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 816#L211-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; 798#L198-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 809#L223 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 802#L226 assume !(node5_~m5~0 != ~nomsg~0); 715#L226-1 ~mode5~0 := 0; 796#L223-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 797#L248 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 786#L251 assume !(node6_~m6~0 != ~nomsg~0); 719#L251-1 ~mode6~0 := 0; 785#L248-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 801#L443 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 812#L444 assume !(~r1~0 >= 6); 772#L447 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 773#L448 assume ~r1~0 < 6;check_~tmp~1 := 1; 865#L443-1 check_#res := check_~tmp~1; 864#L463 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 863#L546 assume !(0 == assert_~arg % 256); 862#L541 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 800#L513-2 [2019-01-14 04:47:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 3 times [2019-01-14 04:47:43,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:43,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:43,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:43,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash -482565050, now seen corresponding path program 1 times [2019-01-14 04:47:43,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:43,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:43,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:47:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash 665183270, now seen corresponding path program 1 times [2019-01-14 04:47:43,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:43,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:43,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:43,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:44,096 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-14 04:47:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:45,412 WARN L181 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 173 DAG size of output: 168 [2019-01-14 04:47:49,362 WARN L181 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 164 DAG size of output: 153 [2019-01-14 04:47:49,376 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:47:49,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:47:49,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:47:49,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:47:49,377 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:47:49,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:49,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:47:49,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:47:49,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:47:49,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:47:49,378 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:47:49,398 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-14 04:47:49,555 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-14 04:47:49,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:49,587 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-14 04:47:49,593 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-14 04:47:49,597 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-14 04:47:49,599 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-14 04:47:49,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:49,706 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-14 04:47:49,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:49,712 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-14 04:47:49,715 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-14 04:47:49,716 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-14 04:47:49,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:49,740 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-14 04:47:51,314 WARN L181 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-01-14 04:47:51,315 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-14 04:47:51,346 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-14 04:47:51,368 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-14 04:47:51,436 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-14 04:47:51,438 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-14 04:47:51,445 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-14 04:47:51,451 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-14 04:47:51,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:51,459 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-14 04:47:51,463 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-14 04:47:51,465 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-14 04:47:51,467 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-14 04:47:51,477 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-14 04:47:51,478 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-14 04:47:51,488 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-14 04:47:51,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:51,496 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-14 04:47:51,499 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-14 04:47:51,973 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-01-14 04:47:52,130 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:48:00,832 WARN L181 SmtUtils]: Spent 8.47 s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2019-01-14 04:48:00,971 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:48:00,972 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-14 04:48:00,980 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:48:00,980 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:48:01,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:48:01,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:48:01,156 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:48:01,158 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:48:01,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:48:01,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:48:01,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:48:01,158 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:48:01,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:48:01,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:48:01,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:48:01,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2019-01-14 04:48:01,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:48:01,159 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:48:01,164 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-14 04:48:01,245 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-14 04:48:01,325 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-14 04:48:01,350 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-14 04:48:01,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:01,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:01,360 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-14 04:48:01,421 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-14 04:48:01,424 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-14 04:48:01,430 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-14 04:48:01,471 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-14 04:48:01,503 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-14 04:48:01,584 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-14 04:48:01,612 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-14 04:48:01,647 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-14 04:48:01,693 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-14 04:48:01,929 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-01-14 04:48:01,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-14 04:48:01,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:01,939 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-14 04:48:01,948 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-14 04:48:01,949 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-14 04:48:01,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:01,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-14 04:48:01,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-14 04:48:01,969 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-14 04:48:01,972 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-14 04:48:01,981 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-14 04:48:01,983 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-14 04:48:01,986 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-14 04:48:01,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:01,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-14 04:48:02,002 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-14 04:48:02,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:48:02,488 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-01-14 04:48:02,621 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:48:11,103 WARN L181 SmtUtils]: Spent 8.36 s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2019-01-14 04:48:11,211 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:48:11,217 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:48:11,219 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-14 04:48:11,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,232 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-14 04:48:11,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,238 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-14 04:48:11,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:11,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:11,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,246 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-14 04:48:11,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,251 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-14 04:48:11,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,256 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-14 04:48:11,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,257 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:48:11,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,261 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:48:11,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,266 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-14 04:48:11,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:11,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:11,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,275 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-14 04:48:11,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,282 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-14 04:48:11,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:11,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:11,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,289 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-14 04:48:11,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:11,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:11,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,297 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-14 04:48:11,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,304 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-14 04:48:11,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,307 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-14 04:48:11,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:11,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:11,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,318 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-14 04:48:11,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:48:11,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:48:11,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,326 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-14 04:48:11,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,329 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2019-01-14 04:48:11,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,374 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2019-01-14 04:48:11,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,500 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-14 04:48:11,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,507 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-14 04:48:11,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:48:11,513 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-14 04:48:11,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:48:11,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:48:11,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:48:11,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:48:11,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:48:11,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:48:11,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:48:11,519 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:48:11,522 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:48:11,523 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:48:11,525 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:48:11,526 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:48:11,526 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:48:11,527 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2019-01-14 04:48:11,528 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:48:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:48:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:11,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:48:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:48:11,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:48:12,101 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-14 04:48:12,108 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-14 04:48:12,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60 Second operand 3 states. [2019-01-14 04:48:12,237 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60. Second operand 3 states. Result 263 states and 382 transitions. Complement of second has 4 states. [2019-01-14 04:48:12,240 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-14 04:48:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:48:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2019-01-14 04:48:12,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 33 letters. [2019-01-14 04:48:12,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:48:12,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 77 letters. Loop has 33 letters. [2019-01-14 04:48:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:48:12,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 66 letters. [2019-01-14 04:48:12,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:48:12,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 382 transitions. [2019-01-14 04:48:12,269 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:48:12,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 0 states and 0 transitions. [2019-01-14 04:48:12,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:48:12,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:48:12,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:48:12,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:12,270 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:12,270 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:12,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:48:12,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:48:12,275 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:48:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:48:12,275 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:48:12,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:48:12,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:48:12,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:48:12,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:48:12,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:48:12,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:48:12,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:48:12,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:48:12,282 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:12,282 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:12,282 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:48:12,282 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:48:12,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:48:12,282 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:48:12,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:48:12,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:48:12 BoogieIcfgContainer [2019-01-14 04:48:12,295 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:48:12,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:48:12,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:48:12,296 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:48:12,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:42" (3/4) ... [2019-01-14 04:48:12,304 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:48:12,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:48:12,308 INFO L168 Benchmark]: Toolchain (without parser) took 31980.74 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 467.1 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -255.5 MB). Peak memory consumption was 211.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:12,310 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:48:12,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.25 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:12,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:12,315 INFO L168 Benchmark]: Boogie Preprocessor took 37.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:12,316 INFO L168 Benchmark]: RCFGBuilder took 1087.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:12,317 INFO L168 Benchmark]: BuchiAutomizer took 30275.89 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 371.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -170.3 MB). Peak memory consumption was 200.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:48:12,325 INFO L168 Benchmark]: Witness Printer took 10.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:48:12,335 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.25 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 136.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1087.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 30275.89 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 371.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -170.3 MB). Peak memory consumption was 200.9 MB. Max. memory is 11.5 GB. * Witness Printer took 10.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 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 30.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 28.8s. Construction of modules took 0.2s. 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 154 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 653 SDtfs, 213 SDslu, 929 SDs, 0 SdLazy, 32 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital1562 mio100 ax104 hnf100 lsp10 ukn72 mio100 lsp100 div153 bol100 ite100 ukn100 eq177 hnf71 smp100 dnf5369 smp24 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 172ms VariablesStem: 0 VariablesLoop: 35 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...