./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.6_true-unreach-call.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 7d8e1a2dd98c6448f68de9ca5556d84e0578394c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:08:55,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:08:55,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:08:55,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:08:55,899 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:08:55,900 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:08:55,901 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:08:55,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:08:55,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:08:55,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:08:55,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:08:55,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:08:55,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:08:55,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:08:55,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:08:55,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:08:55,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:08:55,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:08:55,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:08:55,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:08:55,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:08:55,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:08:55,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:08:55,928 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:08:55,929 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:08:55,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:08:55,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:08:55,932 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:08:55,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:08:55,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:08:55,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:08:55,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:08:55,935 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:08:55,935 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:08:55,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:08:55,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:08:55,938 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:08:55,956 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:08:55,956 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:08:55,957 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:08:55,957 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:08:55,958 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:08:55,958 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:08:55,958 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:08:55,958 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:08:55,958 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:08:55,959 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:08:55,959 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:08:55,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:08:55,959 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:08:55,959 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:08:55,960 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:08:55,960 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:08:55,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:08:55,960 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:08:55,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:08:55,960 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:08:55,961 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:08:55,961 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:08:55,961 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:08:55,961 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:08:55,961 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:08:55,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:08:55,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:08:55,962 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:08:55,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:08:55,962 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:08:55,962 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:08:55,963 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:08:55,964 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 -> 7d8e1a2dd98c6448f68de9ca5556d84e0578394c [2019-01-02 00:08:55,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:08:56,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:08:56,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:08:56,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:08:56,021 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:08:56,022 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2019-01-02 00:08:56,087 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7ee46a3/58455521faff47bd84e496ba95ba4e5e/FLAG1fc382ce4 [2019-01-02 00:08:56,600 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:08:56,601 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2019-01-02 00:08:56,614 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7ee46a3/58455521faff47bd84e496ba95ba4e5e/FLAG1fc382ce4 [2019-01-02 00:08:56,913 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7ee46a3/58455521faff47bd84e496ba95ba4e5e [2019-01-02 00:08:56,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:08:56,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:08:56,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:56,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:08:56,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:08:56,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:56" (1/1) ... [2019-01-02 00:08:56,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5ec0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:56, skipping insertion in model container [2019-01-02 00:08:56,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:56" (1/1) ... [2019-01-02 00:08:56,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:08:56,984 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:08:57,315 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:57,341 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:08:57,479 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:57,505 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:08:57,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57 WrapperNode [2019-01-02 00:08:57,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:57,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:57,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:08:57,507 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:08:57,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... [2019-01-02 00:08:57,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... [2019-01-02 00:08:57,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:57,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:08:57,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:08:57,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:08:57,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... [2019-01-02 00:08:57,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... [2019-01-02 00:08:57,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... [2019-01-02 00:08:57,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... [2019-01-02 00:08:57,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... [2019-01-02 00:08:57,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... [2019-01-02 00:08:57,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... [2019-01-02 00:08:57,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:08:57,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:08:57,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:08:57,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:08:57,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:08:57,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:08:59,102 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:08:59,102 INFO L280 CfgBuilder]: Removed 23 assue(true) statements. [2019-01-02 00:08:59,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:59 BoogieIcfgContainer [2019-01-02 00:08:59,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:08:59,103 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:08:59,103 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:08:59,107 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:08:59,108 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:59,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:08:56" (1/3) ... [2019-01-02 00:08:59,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e966121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:59, skipping insertion in model container [2019-01-02 00:08:59,109 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:59,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:57" (2/3) ... [2019-01-02 00:08:59,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e966121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:59, skipping insertion in model container [2019-01-02 00:08:59,110 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:59,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:59" (3/3) ... [2019-01-02 00:08:59,112 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c [2019-01-02 00:08:59,169 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:08:59,170 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:08:59,170 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:08:59,170 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:08:59,171 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:08:59,171 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:08:59,171 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:08:59,171 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:08:59,171 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:08:59,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2019-01-02 00:08:59,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2019-01-02 00:08:59,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:59,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:59,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:59,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:59,239 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:08:59,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states. [2019-01-02 00:08:59,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2019-01-02 00:08:59,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:59,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:59,250 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:59,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:59,259 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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;~alive5~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;~alive6~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~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~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 8#L332true assume !(0 == ~r1~0);init_~tmp~0 := 0; 10#L332-1true init_#res := init_~tmp~0; 16#L497true main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; 70#L573-2true [2019-01-02 00:08:59,260 INFO L796 eck$LassoCheckResult]: Loop: 70#L573-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 115#L126true 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; 69#L130true assume !(node1_~m1~0 != ~nomsg~0); 68#L130-1true ~mode1~0 := 0; 109#L126-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 32#L161true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 19#L164true assume !(node2_~m2~0 != ~nomsg~0); 18#L164-1true ~mode2~0 := 0; 30#L161-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 125#L195true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 97#L198true assume !(node3_~m3~0 != ~nomsg~0); 92#L198-1true ~mode3~0 := 0; 122#L195-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 56#L229true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 49#L232true assume !(node4_~m4~0 != ~nomsg~0); 48#L232-1true ~mode4~0 := 0; 72#L229-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 9#L263true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 13#L266true assume !(node5_~m5~0 != ~nomsg~0); 134#L266-1true ~mode5~0 := 0; 3#L263-2true havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 99#L297true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 105#L300true assume !(node6_~m6~0 != ~nomsg~0); 103#L300-1true ~mode6~0 := 0; 98#L297-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; 22#L505true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 23#L505-1true check_#res := check_~tmp~1; 126#L517true main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 65#L606true assume !(0 == assert_~arg % 256); 43#L601true main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 70#L573-2true [2019-01-02 00:08:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash 28934070, now seen corresponding path program 1 times [2019-01-02 00:08:59,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:59,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:59,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:59,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:59,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:59,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:59,579 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:08:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash -885212333, now seen corresponding path program 1 times [2019-01-02 00:08:59,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:59,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:59,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:59,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:59,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:59,774 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:59,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:08:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:08:59,793 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 4 states. [2019-01-02 00:09:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:00,218 INFO L93 Difference]: Finished difference Result 144 states and 241 transitions. [2019-01-02 00:09:00,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:09:00,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 241 transitions. [2019-01-02 00:09:00,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-02 00:09:00,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 137 states and 194 transitions. [2019-01-02 00:09:00,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2019-01-02 00:09:00,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2019-01-02 00:09:00,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 194 transitions. [2019-01-02 00:09:00,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:00,262 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2019-01-02 00:09:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 194 transitions. [2019-01-02 00:09:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-02 00:09:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-02 00:09:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2019-01-02 00:09:00,309 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2019-01-02 00:09:00,309 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 194 transitions. [2019-01-02 00:09:00,309 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:09:00,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 194 transitions. [2019-01-02 00:09:00,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-02 00:09:00,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:00,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:00,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:00,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:00,322 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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;~alive5~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;~alive6~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]; 316#L-1 havoc main_#res;havoc 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~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 312#L332 assume 0 == ~r1~0; 313#L333 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 372#L334 assume ~id1~0 >= 0; 373#L335 assume 0 == ~st1~0; 422#L336 assume ~send1~0 == ~id1~0; 361#L337 assume 0 == ~mode1~0 % 256; 362#L338 assume ~id2~0 >= 0; 405#L339 assume 0 == ~st2~0; 317#L340 assume ~send2~0 == ~id2~0; 318#L341 assume 0 == ~mode2~0 % 256; 398#L342 assume ~id3~0 >= 0; 307#L343 assume 0 == ~st3~0; 308#L344 assume ~send3~0 == ~id3~0; 370#L345 assume 0 == ~mode3~0 % 256; 371#L346 assume ~id4~0 >= 0; 421#L347 assume 0 == ~st4~0; 359#L348 assume ~send4~0 == ~id4~0; 360#L349 assume 0 == ~mode4~0 % 256; 404#L350 assume ~id5~0 >= 0; 347#L351 assume 0 == ~st5~0; 348#L352 assume ~send5~0 == ~id5~0; 397#L353 assume 0 == ~mode5~0 % 256; 305#L354 assume ~id6~0 >= 0; 306#L355 assume 0 == ~st6~0; 367#L356 assume ~send6~0 == ~id6~0; 368#L357 assume 0 == ~mode6~0 % 256; 420#L358 assume ~id1~0 != ~id2~0; 355#L359 assume ~id1~0 != ~id3~0; 356#L360 assume ~id1~0 != ~id4~0; 402#L361 assume ~id1~0 != ~id5~0; 344#L362 assume ~id1~0 != ~id6~0; 345#L363 assume ~id2~0 != ~id3~0; 396#L364 assume ~id2~0 != ~id4~0; 303#L365 assume ~id2~0 != ~id5~0; 304#L366 assume ~id2~0 != ~id6~0; 390#L367 assume ~id3~0 != ~id4~0; 391#L368 assume ~id3~0 != ~id5~0; 418#L369 assume ~id3~0 != ~id6~0; 351#L370 assume ~id4~0 != ~id5~0; 352#L371 assume ~id4~0 != ~id6~0; 401#L372 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 314#L332-1 init_#res := init_~tmp~0; 315#L497 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; 324#L573-2 [2019-01-02 00:09:00,325 INFO L796 eck$LassoCheckResult]: Loop: 324#L573-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 409#L126 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; 407#L130 assume !(node1_~m1~0 != ~nomsg~0); 326#L130-1 ~mode1~0 := 0; 339#L126-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 353#L161 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 330#L164 assume !(node2_~m2~0 != ~nomsg~0); 328#L164-1 ~mode2~0 := 0; 329#L161-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 349#L195 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 425#L198 assume !(node3_~m3~0 != ~nomsg~0); 379#L198-1 ~mode3~0 := 0; 415#L195-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 394#L229 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 381#L232 assume !(node4_~m4~0 != ~nomsg~0); 380#L232-1 ~mode4~0 := 0; 358#L229-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 309#L263 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 311#L266 assume !(node5_~m5~0 != ~nomsg~0); 320#L266-1 ~mode5~0 := 0; 301#L263-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 302#L297 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 426#L300 assume !(node6_~m6~0 != ~nomsg~0); 388#L300-1 ~mode6~0 := 0; 408#L297-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; 334#L505 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 335#L505-1 check_#res := check_~tmp~1; 337#L517 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 403#L606 assume !(0 == assert_~arg % 256); 369#L601 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 324#L573-2 [2019-01-02 00:09:00,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:00,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 1 times [2019-01-02 00:09:00,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:00,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:00,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:00,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:00,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash -885212333, now seen corresponding path program 2 times [2019-01-02 00:09:00,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:00,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:00,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:00,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:00,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:00,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:00,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:09:00,666 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:09:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:09:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:09:00,667 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. cyclomatic complexity: 58 Second operand 5 states. [2019-01-02 00:09:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:00,890 INFO L93 Difference]: Finished difference Result 140 states and 196 transitions. [2019-01-02 00:09:00,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:09:00,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 196 transitions. [2019-01-02 00:09:00,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-02 00:09:00,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 192 transitions. [2019-01-02 00:09:00,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2019-01-02 00:09:00,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2019-01-02 00:09:00,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 192 transitions. [2019-01-02 00:09:00,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:00,899 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 192 transitions. [2019-01-02 00:09:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 192 transitions. [2019-01-02 00:09:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-02 00:09:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-02 00:09:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2019-01-02 00:09:00,909 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 192 transitions. [2019-01-02 00:09:00,909 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 192 transitions. [2019-01-02 00:09:00,910 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:09:00,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 192 transitions. [2019-01-02 00:09:00,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-02 00:09:00,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:09:00,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:09:00,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:00,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:09:00,916 INFO L794 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~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;~alive5~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;~alive6~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]; 605#L-1 havoc main_#res;havoc 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~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 601#L332 assume 0 == ~r1~0; 602#L333 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 661#L334 assume ~id1~0 >= 0; 662#L335 assume 0 == ~st1~0; 711#L336 assume ~send1~0 == ~id1~0; 650#L337 assume 0 == ~mode1~0 % 256; 651#L338 assume ~id2~0 >= 0; 694#L339 assume 0 == ~st2~0; 606#L340 assume ~send2~0 == ~id2~0; 607#L341 assume 0 == ~mode2~0 % 256; 687#L342 assume ~id3~0 >= 0; 596#L343 assume 0 == ~st3~0; 597#L344 assume ~send3~0 == ~id3~0; 659#L345 assume 0 == ~mode3~0 % 256; 660#L346 assume ~id4~0 >= 0; 710#L347 assume 0 == ~st4~0; 648#L348 assume ~send4~0 == ~id4~0; 649#L349 assume 0 == ~mode4~0 % 256; 693#L350 assume ~id5~0 >= 0; 636#L351 assume 0 == ~st5~0; 637#L352 assume ~send5~0 == ~id5~0; 686#L353 assume 0 == ~mode5~0 % 256; 594#L354 assume ~id6~0 >= 0; 595#L355 assume 0 == ~st6~0; 656#L356 assume ~send6~0 == ~id6~0; 657#L357 assume 0 == ~mode6~0 % 256; 709#L358 assume ~id1~0 != ~id2~0; 644#L359 assume ~id1~0 != ~id3~0; 645#L360 assume ~id1~0 != ~id4~0; 691#L361 assume ~id1~0 != ~id5~0; 634#L362 assume ~id1~0 != ~id6~0; 635#L363 assume ~id2~0 != ~id3~0; 685#L364 assume ~id2~0 != ~id4~0; 592#L365 assume ~id2~0 != ~id5~0; 593#L366 assume ~id2~0 != ~id6~0; 679#L367 assume ~id3~0 != ~id4~0; 680#L368 assume ~id3~0 != ~id5~0; 707#L369 assume ~id3~0 != ~id6~0; 640#L370 assume ~id4~0 != ~id5~0; 641#L371 assume ~id4~0 != ~id6~0; 690#L372 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 603#L332-1 init_#res := init_~tmp~0; 604#L497 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; 613#L573-2 [2019-01-02 00:09:00,916 INFO L796 eck$LassoCheckResult]: Loop: 613#L573-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 698#L126 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; 696#L130 assume !(node1_~m1~0 != ~nomsg~0); 615#L130-1 ~mode1~0 := 0; 628#L126-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 642#L161 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 619#L164 assume !(node2_~m2~0 != ~nomsg~0); 617#L164-1 ~mode2~0 := 0; 618#L161-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 638#L195 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 714#L198 assume !(node3_~m3~0 != ~nomsg~0); 668#L198-1 ~mode3~0 := 0; 704#L195-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 683#L229 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 670#L232 assume !(node4_~m4~0 != ~nomsg~0); 669#L232-1 ~mode4~0 := 0; 647#L229-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 598#L263 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 600#L266 assume !(node5_~m5~0 != ~nomsg~0); 609#L266-1 ~mode5~0 := 0; 590#L263-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 591#L297 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 715#L300 assume !(node6_~m6~0 != ~nomsg~0); 677#L300-1 ~mode6~0 := 0; 697#L297-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; 623#L505 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 624#L506 assume ~r1~0 < 6;check_~tmp~1 := 1; 625#L505-1 check_#res := check_~tmp~1; 626#L517 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 692#L606 assume !(0 == assert_~arg % 256); 658#L601 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 613#L573-2 [2019-01-02 00:09:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:00,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 2 times [2019-01-02 00:09:00,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:00,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:00,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:00,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:00,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:01,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2055105496, now seen corresponding path program 1 times [2019-01-02 00:09:01,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:01,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:01,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:09:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:09:01,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash -122585655, now seen corresponding path program 1 times [2019-01-02 00:09:01,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:09:01,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:09:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:01,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:09:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:09:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:01,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:09:01,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:09:02,115 WARN L181 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2019-01-02 00:09:03,794 WARN L181 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2019-01-02 00:09:03,808 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:03,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:03,809 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:03,809 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:03,809 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:09:03,809 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:03,809 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:03,810 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:03,810 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:09:03,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:03,810 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:03,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,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-02 00:09:03,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:03,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:04,564 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-02 00:09:05,044 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-02 00:09:05,168 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:05,169 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:05,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:05,176 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:05,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:09:05,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:09:05,358 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:09:05,360 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:05,361 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:05,361 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:05,361 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:05,361 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:09:05,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:05,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:05,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:05,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_true-unreach-call.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:09:05,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:05,362 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:05,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,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-02 00:09:05,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:05,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:06,459 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-02 00:09:06,878 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-02 00:09:06,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:06,898 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:09:06,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:06,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:06,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:06,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:06,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:06,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:06,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:06,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:06,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:06,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:06,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:06,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:06,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:06,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:06,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:06,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:06,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:06,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:06,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:06,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,955 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:09:06,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,959 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:09:06,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:06,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:06,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:06,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:06,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:06,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:06,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:06,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:06,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:06,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:06,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:06,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:06,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:06,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:06,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:06,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:06,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:06,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:06,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:06,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:06,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:06,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:07,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:07,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:07,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:07,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:07,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:07,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:07,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:07,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:07,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:07,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:07,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:07,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:07,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:07,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:07,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:07,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:07,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:07,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:07,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:07,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:07,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:07,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:07,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:07,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:07,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:07,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:07,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:07,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:07,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:07,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:07,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:07,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:07,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:07,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:07,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:07,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:07,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:07,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:07,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:07,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:07,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:07,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:07,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:07,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:07,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:07,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:07,038 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:09:07,042 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:09:07,042 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:09:07,045 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:09:07,045 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:09:07,045 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:09:07,047 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-02 00:09:07,048 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:09:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:07,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:07,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:07,337 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:09:07,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137 states and 192 transitions. cyclomatic complexity: 56 Second operand 3 states. [2019-01-02 00:09:07,433 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137 states and 192 transitions. cyclomatic complexity: 56. Second operand 3 states. Result 229 states and 340 transitions. Complement of second has 4 states. [2019-01-02 00:09:07,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:09:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:09:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2019-01-02 00:09:07,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 192 transitions. Stem has 45 letters. Loop has 31 letters. [2019-01-02 00:09:07,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:07,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 192 transitions. Stem has 76 letters. Loop has 31 letters. [2019-01-02 00:09:07,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:07,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 192 transitions. Stem has 45 letters. Loop has 62 letters. [2019-01-02 00:09:07,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:07,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 340 transitions. [2019-01-02 00:09:07,456 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:07,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 0 states and 0 transitions. [2019-01-02 00:09:07,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:07,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:07,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:07,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:07,457 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:07,457 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:07,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:09:07,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:09:07,458 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-02 00:09:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:07,458 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:09:07,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:09:07,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:09:07,459 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:07,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:09:07,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:07,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:07,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:07,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:07,459 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:07,459 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:07,459 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:07,459 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:09:07,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:09:07,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:07,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:09:07,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:09:07 BoogieIcfgContainer [2019-01-02 00:09:07,475 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:09:07,476 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:09:07,476 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:09:07,476 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:09:07,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:59" (3/4) ... [2019-01-02 00:09:07,482 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:09:07,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:09:07,484 INFO L168 Benchmark]: Toolchain (without parser) took 10565.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 148.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:07,486 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:07,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.90 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:07,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:07,490 INFO L168 Benchmark]: Boogie Preprocessor took 45.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:07,492 INFO L168 Benchmark]: RCFGBuilder took 1401.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:07,494 INFO L168 Benchmark]: BuchiAutomizer took 8372.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -64.0 MB). Peak memory consumption was 124.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:07,496 INFO L168 Benchmark]: Witness Printer took 6.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:07,502 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.45 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 585.90 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.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 149.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1401.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8372.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -64.0 MB). Peak memory consumption was 124.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 137 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 621 SDtfs, 339 SDslu, 1148 SDs, 0 SdLazy, 22 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax121 hnf105 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...