./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.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.4_true-unreach-call.ufo.BOUNDED-8.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 9617a298e8318064de96aca26d3538590248ba76 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:46,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:08:46,138 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:08:46,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:08:46,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:08:46,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:08:46,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:08:46,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:08:46,158 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:08:46,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:08:46,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:08:46,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:08:46,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:08:46,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:08:46,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:08:46,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:08:46,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:08:46,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:08:46,170 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:08:46,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:08:46,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:08:46,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:08:46,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:08:46,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:08:46,178 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:08:46,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:08:46,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:08:46,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:08:46,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:08:46,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:08:46,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:08:46,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:08:46,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:08:46,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:08:46,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:08:46,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:08:46,187 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:46,210 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:08:46,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:08:46,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:08:46,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:08:46,213 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:08:46,213 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:08:46,213 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:08:46,213 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:08:46,213 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:08:46,213 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:08:46,214 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:08:46,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:08:46,214 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:08:46,214 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:08:46,214 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:08:46,215 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:08:46,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:08:46,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:08:46,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:08:46,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:08:46,216 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:08:46,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:08:46,217 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:08:46,217 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:08:46,217 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:08:46,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:08:46,217 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:08:46,217 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:08:46,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:08:46,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:08:46,219 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:08:46,220 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:08:46,221 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 -> 9617a298e8318064de96aca26d3538590248ba76 [2019-01-02 00:08:46,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:08:46,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:08:46,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:08:46,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:08:46,304 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:08:46,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2019-01-02 00:08:46,372 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e556730/d53c1be6ce214d6ea3fa5fe066c3515e/FLAG6ec136e44 [2019-01-02 00:08:46,921 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:08:46,923 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2019-01-02 00:08:46,937 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e556730/d53c1be6ce214d6ea3fa5fe066c3515e/FLAG6ec136e44 [2019-01-02 00:08:47,193 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e556730/d53c1be6ce214d6ea3fa5fe066c3515e [2019-01-02 00:08:47,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:08:47,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:08:47,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:47,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:08:47,206 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:08:47,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:47" (1/1) ... [2019-01-02 00:08:47,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd9b2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:47, skipping insertion in model container [2019-01-02 00:08:47,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:47" (1/1) ... [2019-01-02 00:08:47,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:08:47,279 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:08:47,551 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:47,562 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:08:47,618 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:47,640 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:08:47,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:47 WrapperNode [2019-01-02 00:08:47,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:47,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:47,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:08:47,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:08:47,717 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:47" (1/1) ... [2019-01-02 00:08:47,729 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:47" (1/1) ... [2019-01-02 00:08:47,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:47,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:08:47,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:08:47,768 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:08:47,781 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:47" (1/1) ... [2019-01-02 00:08:47,781 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:47" (1/1) ... [2019-01-02 00:08:47,784 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:47" (1/1) ... [2019-01-02 00:08:47,785 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:47" (1/1) ... [2019-01-02 00:08:47,793 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:47" (1/1) ... [2019-01-02 00:08:47,801 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:47" (1/1) ... [2019-01-02 00:08:47,805 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:47" (1/1) ... [2019-01-02 00:08:47,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:08:47,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:08:47,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:08:47,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:08:47,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:47" (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:47,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:08:47,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:08:49,044 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:08:49,044 INFO L280 CfgBuilder]: Removed 19 assue(true) statements. [2019-01-02 00:08:49,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:49 BoogieIcfgContainer [2019-01-02 00:08:49,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:08:49,046 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:08:49,046 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:08:49,050 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:08:49,051 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:49,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:08:47" (1/3) ... [2019-01-02 00:08:49,053 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ac1117c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:49, skipping insertion in model container [2019-01-02 00:08:49,053 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:49,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:47" (2/3) ... [2019-01-02 00:08:49,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ac1117c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:49, skipping insertion in model container [2019-01-02 00:08:49,054 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:49,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:49" (3/3) ... [2019-01-02 00:08:49,056 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c [2019-01-02 00:08:49,124 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:08:49,125 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:08:49,126 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:08:49,126 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:08:49,126 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:08:49,126 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:08:49,127 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:08:49,127 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:08:49,127 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:08:49,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states. [2019-01-02 00:08:49,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-01-02 00:08:49,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:49,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:49,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:49,187 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] [2019-01-02 00:08:49,187 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:08:49,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states. [2019-01-02 00:08:49,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-01-02 00:08:49,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:49,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:49,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:49,197 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] [2019-01-02 00:08:49,207 INFO L794 eck$LassoCheckResult]: Stem: 69#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;~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]; 7#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~alive1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id2~0 := main_#t~nondet14;havoc main_#t~nondet14;~st2~0 := main_#t~nondet15;havoc main_#t~nondet15;~send2~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode2~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive4~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 97#L247true assume !(0 == ~r1~0);init_~tmp~0 := 0; 96#L247-1true init_#res := init_~tmp~0; 63#L344true main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29;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;main_~i2~0 := 0; 8#L406-2true [2019-01-02 00:08:49,208 INFO L796 eck$LassoCheckResult]: Loop: 8#L406-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 75#L110true 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 18#L114true assume !(node1_~m1~0 != ~nomsg~0); 16#L114-1true ~mode1~0 := 0; 72#L110-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 91#L145true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 82#L148true assume !(node2_~m2~0 != ~nomsg~0); 80#L148-1true ~mode2~0 := 0; 89#L145-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 51#L179true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 55#L182true assume !(node3_~m3~0 != ~nomsg~0); 53#L182-1true ~mode3~0 := 0; 49#L179-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 34#L213true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 24#L216true assume !(node4_~m4~0 != ~nomsg~0); 23#L216-1true ~mode4~0 := 0; 19#L213-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 81#L352true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 83#L352-1true check_#res := check_~tmp~1; 42#L364true main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 37#L433true assume !(0 == assert_~arg % 256); 17#L428true main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 8#L406-2true [2019-01-02 00:08:49,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash 28832784, now seen corresponding path program 1 times [2019-01-02 00:08:49,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:49,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:49,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:49,469 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:49,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:49,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:49,476 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:08:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1703887177, now seen corresponding path program 1 times [2019-01-02 00:08:49,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:49,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:49,599 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:49,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:49,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:49,602 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:49,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:08:49,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:08:49,624 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 4 states. [2019-01-02 00:08:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:49,763 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2019-01-02 00:08:49,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:08:49,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 161 transitions. [2019-01-02 00:08:49,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-02 00:08:49,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 92 states and 131 transitions. [2019-01-02 00:08:49,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-01-02 00:08:49,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-01-02 00:08:49,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 131 transitions. [2019-01-02 00:08:49,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:49,782 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 131 transitions. [2019-01-02 00:08:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 131 transitions. [2019-01-02 00:08:49,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-02 00:08:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-02 00:08:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2019-01-02 00:08:49,819 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 131 transitions. [2019-01-02 00:08:49,819 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 131 transitions. [2019-01-02 00:08:49,819 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:08:49,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 131 transitions. [2019-01-02 00:08:49,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-02 00:08:49,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:49,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:49,823 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] [2019-01-02 00:08:49,823 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] [2019-01-02 00:08:49,824 INFO L794 eck$LassoCheckResult]: Stem: 269#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;~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]; 229#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~alive1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id2~0 := main_#t~nondet14;havoc main_#t~nondet14;~st2~0 := main_#t~nondet15;havoc main_#t~nondet15;~send2~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode2~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive4~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 230#L247 assume 0 == ~r1~0; 242#L248 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 243#L249 assume ~id1~0 >= 0; 279#L250 assume 0 == ~st1~0; 283#L251 assume ~send1~0 == ~id1~0; 218#L252 assume 0 == ~mode1~0 % 256; 219#L253 assume ~id2~0 >= 0; 262#L254 assume 0 == ~st2~0; 231#L255 assume ~send2~0 == ~id2~0; 232#L256 assume 0 == ~mode2~0 % 256; 270#L257 assume ~id3~0 >= 0; 294#L258 assume 0 == ~st3~0; 244#L259 assume ~send3~0 == ~id3~0; 245#L260 assume 0 == ~mode3~0 % 256; 280#L261 assume ~id4~0 >= 0; 284#L262 assume 0 == ~st4~0; 220#L263 assume ~send4~0 == ~id4~0; 221#L264 assume 0 == ~mode4~0 % 256; 263#L265 assume ~id1~0 != ~id2~0; 233#L266 assume ~id1~0 != ~id3~0; 234#L267 assume ~id1~0 != ~id4~0; 271#L268 assume ~id2~0 != ~id3~0; 295#L269 assume ~id2~0 != ~id4~0; 249#L270 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 250#L247-1 init_#res := init_~tmp~0; 256#L344 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29;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;main_~i2~0 := 0; 227#L406-2 [2019-01-02 00:08:49,824 INFO L796 eck$LassoCheckResult]: Loop: 227#L406-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 228#L110 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 260#L114 assume !(node1_~m1~0 != ~nomsg~0); 258#L114-1 ~mode1~0 := 0; 241#L110-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 272#L145 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 291#L148 assume !(node2_~m2~0 != ~nomsg~0); 237#L148-1 ~mode2~0 := 0; 278#L145-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 224#L179 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 225#L182 assume !(node3_~m3~0 != ~nomsg~0); 238#L182-1 ~mode3~0 := 0; 216#L179-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 217#L213 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 276#L216 assume !(node4_~m4~0 != ~nomsg~0); 274#L216-1 ~mode4~0 := 0; 264#L213-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 265#L352 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 282#L352-1 check_#res := check_~tmp~1; 292#L364 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 298#L433 assume !(0 == assert_~arg % 256); 259#L428 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 227#L406-2 [2019-01-02 00:08:49,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 1 times [2019-01-02 00:08:49,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:49,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:49,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:49,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:49,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1703887177, now seen corresponding path program 2 times [2019-01-02 00:08:49,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:49,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:49,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:50,221 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:50,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:50,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:50,222 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:50,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:08:50,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:08:50,223 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. cyclomatic complexity: 40 Second operand 5 states. [2019-01-02 00:08:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:50,355 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2019-01-02 00:08:50,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:08:50,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 133 transitions. [2019-01-02 00:08:50,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-02 00:08:50,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 92 states and 129 transitions. [2019-01-02 00:08:50,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-01-02 00:08:50,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-01-02 00:08:50,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 129 transitions. [2019-01-02 00:08:50,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:50,367 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2019-01-02 00:08:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 129 transitions. [2019-01-02 00:08:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-02 00:08:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-02 00:08:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2019-01-02 00:08:50,380 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2019-01-02 00:08:50,381 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2019-01-02 00:08:50,381 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:08:50,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 129 transitions. [2019-01-02 00:08:50,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2019-01-02 00:08:50,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:50,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:50,385 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] [2019-01-02 00:08:50,385 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] [2019-01-02 00:08:50,385 INFO L794 eck$LassoCheckResult]: Stem: 466#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;~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]; 426#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~alive1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id2~0 := main_#t~nondet14;havoc main_#t~nondet14;~st2~0 := main_#t~nondet15;havoc main_#t~nondet15;~send2~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode2~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive3~0 := main_#t~nondet23;havoc main_#t~nondet23;~id4~0 := main_#t~nondet24;havoc main_#t~nondet24;~st4~0 := main_#t~nondet25;havoc main_#t~nondet25;~send4~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode4~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive4~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 427#L247 assume 0 == ~r1~0; 441#L248 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 442#L249 assume ~id1~0 >= 0; 478#L250 assume 0 == ~st1~0; 482#L251 assume ~send1~0 == ~id1~0; 417#L252 assume 0 == ~mode1~0 % 256; 418#L253 assume ~id2~0 >= 0; 461#L254 assume 0 == ~st2~0; 428#L255 assume ~send2~0 == ~id2~0; 429#L256 assume 0 == ~mode2~0 % 256; 467#L257 assume ~id3~0 >= 0; 493#L258 assume 0 == ~st3~0; 443#L259 assume ~send3~0 == ~id3~0; 444#L260 assume 0 == ~mode3~0 % 256; 479#L261 assume ~id4~0 >= 0; 483#L262 assume 0 == ~st4~0; 419#L263 assume ~send4~0 == ~id4~0; 420#L264 assume 0 == ~mode4~0 % 256; 462#L265 assume ~id1~0 != ~id2~0; 432#L266 assume ~id1~0 != ~id3~0; 433#L267 assume ~id1~0 != ~id4~0; 470#L268 assume ~id2~0 != ~id3~0; 494#L269 assume ~id2~0 != ~id4~0; 448#L270 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 449#L247-1 init_#res := init_~tmp~0; 455#L344 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29;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;main_~i2~0 := 0; 430#L406-2 [2019-01-02 00:08:50,386 INFO L796 eck$LassoCheckResult]: Loop: 430#L406-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 431#L110 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 459#L114 assume !(node1_~m1~0 != ~nomsg~0); 457#L114-1 ~mode1~0 := 0; 440#L110-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 471#L145 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 491#L148 assume !(node2_~m2~0 != ~nomsg~0); 436#L148-1 ~mode2~0 := 0; 477#L145-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 423#L179 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 424#L182 assume !(node3_~m3~0 != ~nomsg~0); 437#L182-1 ~mode3~0 := 0; 415#L179-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 416#L213 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 475#L216 assume !(node4_~m4~0 != ~nomsg~0); 472#L216-1 ~mode4~0 := 0; 463#L213-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 464#L352 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 488#L353 assume ~r1~0 < 4;check_~tmp~1 := 1; 481#L352-1 check_#res := check_~tmp~1; 490#L364 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 495#L433 assume !(0 == assert_~arg % 256); 458#L428 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 430#L406-2 [2019-01-02 00:08:50,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:50,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1386311927, now seen corresponding path program 2 times [2019-01-02 00:08:50,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:50,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:50,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:50,502 INFO L82 PathProgramCache]: Analyzing trace with hash 897567768, now seen corresponding path program 1 times [2019-01-02 00:08:50,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:50,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:50,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:50,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:50,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:50,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash 490525712, now seen corresponding path program 1 times [2019-01-02 00:08:50,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:50,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:50,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:50,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:50,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:50,677 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:50,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:50,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:51,622 WARN L181 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 117 [2019-01-02 00:08:52,788 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2019-01-02 00:08:52,805 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:52,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:52,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:52,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:52,807 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:08:52,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:52,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:52,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:52,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:08:52,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:52,808 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:52,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,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:08:52,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:52,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,031 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-02 00:08:53,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,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:08:53,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:53,937 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:53,938 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:53,949 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:08:53,949 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:53,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:08:53,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:08:54,144 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:08:54,147 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:54,147 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:54,147 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:54,147 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:54,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:08:54,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:54,148 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:54,148 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:54,148 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4_true-unreach-call.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:08:54,148 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:54,148 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:54,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,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:08:54,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:08:54,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:54,609 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-02 00:08:55,172 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2019-01-02 00:08:55,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:08:55,362 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:08:55,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:55,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:55,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:55,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:55,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:55,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:55,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:55,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:55,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:55,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:55,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,435 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:08:55,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,437 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:08:55,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:55,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:55,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:55,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:55,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:55,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:08:55,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:08:55,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:55,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:08:55,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:08:55,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:08:55,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:08:55,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:08:55,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:08:55,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:08:55,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:08:55,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:08:55,474 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:08:55,478 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:08:55,478 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:08:55,480 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:08:55,480 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:08:55,481 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:08:55,481 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-01-02 00:08:55,482 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:08:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:55,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:55,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:08:55,661 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:55,664 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:08:55,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 129 transitions. cyclomatic complexity: 38 Second operand 3 states. [2019-01-02 00:08:55,733 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 129 transitions. cyclomatic complexity: 38. Second operand 3 states. Result 156 states and 231 transitions. Complement of second has 4 states. [2019-01-02 00:08:55,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:08:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:08:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2019-01-02 00:08:55,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 129 transitions. Stem has 28 letters. Loop has 23 letters. [2019-01-02 00:08:55,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:55,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 129 transitions. Stem has 51 letters. Loop has 23 letters. [2019-01-02 00:08:55,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:55,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 129 transitions. Stem has 28 letters. Loop has 46 letters. [2019-01-02 00:08:55,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:08:55,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 231 transitions. [2019-01-02 00:08:55,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:55,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 0 states and 0 transitions. [2019-01-02 00:08:55,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:08:55,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:08:55,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:08:55,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:55,745 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:55,745 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:55,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:08:55,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:08:55,746 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-02 00:08:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:55,746 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:08:55,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:08:55,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:08:55,747 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:55,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:08:55,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:08:55,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:08:55,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:08:55,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:55,747 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:55,747 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:55,748 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:08:55,748 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:08:55,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:08:55,748 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:08:55,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:08:55,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:08:55 BoogieIcfgContainer [2019-01-02 00:08:55,755 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:08:55,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:08:55,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:08:55,756 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:08:55,757 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:49" (3/4) ... [2019-01-02 00:08:55,760 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:08:55,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:08:55,761 INFO L168 Benchmark]: Toolchain (without parser) took 8564.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 952.7 MB in the beginning and 894.1 MB in the end (delta: 58.6 MB). Peak memory consumption was 264.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:55,763 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:08:55,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.98 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:55,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:55,765 INFO L168 Benchmark]: Boogie Preprocessor took 44.63 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:55,766 INFO L168 Benchmark]: RCFGBuilder took 1232.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:55,766 INFO L168 Benchmark]: BuchiAutomizer took 6709.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 894.1 MB in the end (delta: 190.9 MB). Peak memory consumption was 260.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:08:55,767 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 1.2 GB. Free memory is still 894.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:08:55,773 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.18 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 441.98 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.63 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1232.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6709.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 894.1 MB in the end (delta: 190.9 MB). Peak memory consumption was 260.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 ms. Allocated memory is still 1.2 GB. Free memory is still 894.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 92 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 415 SDtfs, 230 SDslu, 770 SDs, 0 SdLazy, 22 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax118 hnf104 lsp17 ukn86 mio100 lsp100 div132 bol100 ite100 ukn100 eq172 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...