./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.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/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.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 b315ebc9aa87bd57f2da57a423e25fac07ed5d29 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:17:16,125 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:17:16,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:17:16,148 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:17:16,148 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:17:16,149 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:17:16,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:17:16,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:17:16,156 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:17:16,159 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:17:16,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:17:16,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:17:16,163 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:17:16,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:17:16,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:17:16,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:17:16,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:17:16,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:17:16,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:17:16,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:17:16,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:17:16,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:17:16,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:17:16,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:17:16,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:17:16,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:17:16,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:17:16,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:17:16,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:17:16,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:17:16,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:17:16,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:17:16,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:17:16,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:17:16,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:17:16,202 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:17:16,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:17:16,237 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:17:16,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:17:16,242 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:17:16,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:17:16,245 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:17:16,245 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:17:16,246 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:17:16,246 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:17:16,246 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:17:16,246 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:17:16,246 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:17:16,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:17:16,247 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:17:16,247 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:17:16,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:17:16,247 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:17:16,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:17:16,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:17:16,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:17:16,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:17:16,249 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:17:16,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:17:16,250 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:17:16,250 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:17:16,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:17:16,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:17:16,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:17:16,250 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:17:16,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:17:16,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:17:16,253 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:17:16,254 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:17:16,254 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 -> b315ebc9aa87bd57f2da57a423e25fac07ed5d29 [2019-01-01 23:17:16,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:17:16,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:17:16,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:17:16,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:17:16,321 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:17:16,322 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.c [2019-01-01 23:17:16,391 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38a15d39/852a15d6acec429cab307505adf1a0f6/FLAG3dc7ee479 [2019-01-01 23:17:16,966 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:17:16,966 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec1_product30_false-unreach-call_true-termination.cil.c [2019-01-01 23:17:17,002 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38a15d39/852a15d6acec429cab307505adf1a0f6/FLAG3dc7ee479 [2019-01-01 23:17:17,168 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38a15d39/852a15d6acec429cab307505adf1a0f6 [2019-01-01 23:17:17,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:17:17,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:17:17,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:17:17,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:17:17,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:17:17,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:17:17" (1/1) ... [2019-01-01 23:17:17,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fed245b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:17, skipping insertion in model container [2019-01-01 23:17:17,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:17:17" (1/1) ... [2019-01-01 23:17:17,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:17:17,301 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:17:18,087 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:17:18,110 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:17:18,404 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:17:18,472 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:17:18,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18 WrapperNode [2019-01-01 23:17:18,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:17:18,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:17:18,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:17:18,474 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:17:18,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (1/1) ... [2019-01-01 23:17:18,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (1/1) ... [2019-01-01 23:17:18,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:17:18,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:17:18,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:17:18,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:17:18,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (1/1) ... [2019-01-01 23:17:18,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (1/1) ... [2019-01-01 23:17:19,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (1/1) ... [2019-01-01 23:17:19,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (1/1) ... [2019-01-01 23:17:19,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (1/1) ... [2019-01-01 23:17:19,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (1/1) ... [2019-01-01 23:17:19,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (1/1) ... [2019-01-01 23:17:19,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:17:19,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:17:19,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:17:19,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:17:19,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (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-01 23:17:19,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:17:19,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:17:19,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:17:19,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:17:36,498 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:17:36,499 INFO L280 CfgBuilder]: Removed 1529 assue(true) statements. [2019-01-01 23:17:36,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:17:36 BoogieIcfgContainer [2019-01-01 23:17:36,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:17:36,501 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:17:36,501 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:17:36,505 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:17:36,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:17:36,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:17:17" (1/3) ... [2019-01-01 23:17:36,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ee98e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:17:36, skipping insertion in model container [2019-01-01 23:17:36,508 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:17:36,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:17:18" (2/3) ... [2019-01-01 23:17:36,508 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ee98e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:17:36, skipping insertion in model container [2019-01-01 23:17:36,508 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:17:36,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:17:36" (3/3) ... [2019-01-01 23:17:36,511 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product30_false-unreach-call_true-termination.cil.c [2019-01-01 23:17:36,571 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:17:36,571 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:17:36,572 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:17:36,572 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:17:36,572 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:17:36,572 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:17:36,572 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:17:36,572 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:17:36,572 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:17:36,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6902 states. [2019-01-01 23:17:36,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3411 [2019-01-01 23:17:36,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:17:36,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:17:36,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:17:36,912 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-01 23:17:36,912 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:17:36,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6902 states. [2019-01-01 23:17:37,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3411 [2019-01-01 23:17:37,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:17:37,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:17:37,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:17:37,016 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-01 23:17:37,031 INFO L794 eck$LassoCheckResult]: Stem: 1556#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(30);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(9);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(25);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(30);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(9);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(25);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(95, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string114.base, #t~string114.offset, 1);call write~init~int(93, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 3 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(97, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(116, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(32, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 4 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string118.base, #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 2 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(10);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string122.base, #t~string122.offset, 1);call write~init~int(112, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 2 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string124.base, #t~string124.offset, 1);call write~init~int(111, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(119, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(110, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 4 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(73, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(76, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(95, #t~string126.base, 3 + #t~string126.offset, 1);call write~init~int(112, #t~string126.base, 4 + #t~string126.offset, 1);call write~init~int(58, #t~string126.base, 5 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 6 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string138.base, #t~string138.offset, 1);call write~init~int(70, #t~string138.base, 1 + #t~string138.offset, 1);call write~init~int(95, #t~string138.base, 2 + #t~string138.offset, 1);call write~init~int(112, #t~string138.base, 3 + #t~string138.offset, 1);call write~init~int(58, #t~string138.base, 4 + #t~string138.offset, 1);call write~init~int(0, #t~string138.base, 5 + #t~string138.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string144.base, #t~string144.offset, 1);call write~init~int(37, #t~string144.base, 1 + #t~string144.offset, 1);call write~init~int(105, #t~string144.base, 2 + #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 3 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string150.base, #t~string150.offset, 1);call write~init~int(37, #t~string150.base, 1 + #t~string150.offset, 1);call write~init~int(105, #t~string150.base, 2 + #t~string150.offset, 1);call write~init~int(0, #t~string150.base, 3 + #t~string150.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string153.base, #t~string153.offset, 1);call write~init~int(37, #t~string153.base, 1 + #t~string153.offset, 1);call write~init~int(105, #t~string153.base, 2 + #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 3 + #t~string153.offset, 1);call #t~string155.base, #t~string155.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string155.base, #t~string155.offset, 1);call write~init~int(0, #t~string155.base, 1 + #t~string155.offset, 1);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(9);~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 6568#L-1true havoc main_#res;havoc main_#t~ret55, main_~retValue_acc~6, main_~tmp~13;havoc main_~retValue_acc~6;havoc main_~tmp~13; 6319#L557true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 6101#L565true main_#t~ret55 := valid_product_#res;main_~tmp~13 := main_#t~ret55;havoc main_#t~ret55; 6330#L909true assume 0 != main_~tmp~13; 6508#L882true ~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 4246#L3307true havoc bigMacCall_#t~ret48, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~11;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~11; 1130#L1640true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~11 := 4;getOrigin_#res := getOrigin_~retValue_acc~11; 451#L1665true bigMacCall_#t~ret48 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret48;havoc bigMacCall_#t~ret48;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1090#L1287true assume 0 == initPersonOnFloor_~floor; 1119#L1288true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4146#L1395-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 5495#L3314true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3224#L3326-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6138#L1091-2true havoc angelinaCall_#t~ret45, angelinaCall_~tmp~7;havoc angelinaCall_~tmp~7;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~11;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~11; 1132#L1640-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~11 := 4;getOrigin_#res := getOrigin_~retValue_acc~11; 455#L1665-1true angelinaCall_#t~ret45 := getOrigin_#res;angelinaCall_~tmp~7 := angelinaCall_#t~ret45;havoc angelinaCall_#t~ret45;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1093#L1287-1true assume 0 == initPersonOnFloor_~floor; 1120#L1288-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4150#L1395-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 5500#L3314-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 3217#L3326-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6131#L1091-5true havoc cleanup_#t~ret49, cleanup_#t~ret50, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret109, timeShift_~tmp~26;havoc timeShift_~tmp~26;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6229#L1969true timeShift_#t~ret109 := areDoorsOpen_#res;timeShift_~tmp~26 := timeShift_#t~ret109;havoc timeShift_#t~ret109; 2753#L2919true assume 0 != timeShift_~tmp~26; 2810#L2920true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4795#L2595-11true havoc __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_#t~ret165, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~29, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~29;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5952#L1960-2true __utac_acc__Specification1_spec__3_#t~ret160 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~29 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~29; 6467#L3352true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 6408#L3353true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6231#L1969-1true __utac_acc__Specification1_spec__3_#t~ret161 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret161;havoc __utac_acc__Specification1_spec__3_#t~ret161; 6770#L3357true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 143#L3412true cleanup_~i~2 := 0; 6773#L714-2true [2019-01-01 23:17:37,032 INFO L796 eck$LassoCheckResult]: Loop: 6773#L714-2true assume !false; 6796#L715true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 6766#L718true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 5755#L1787true cleanup_#t~ret49 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 5980#L722true assume 1 != cleanup_~tmp___0~2; 5981#L722-1true havoc isIdle_#res;havoc isIdle_#t~ret64, isIdle_~retValue_acc~20, isIdle_~tmp~18;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~7;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~7; 4670#L1011-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~7 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~7; 4030#L1038-122true anyStopRequested_#t~ret59 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret59;havoc anyStopRequested_#t~ret59; 4711#L2068true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 5960#L2132true isIdle_#t~ret64 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret64;havoc isIdle_#t~ret64;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 6234#L2145true cleanup_#t~ret50 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret50;havoc cleanup_#t~ret50; 6361#L734true assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret109, timeShift_~tmp~26;havoc timeShift_~tmp~26;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6222#L1969-6true timeShift_#t~ret109 := areDoorsOpen_#res;timeShift_~tmp~26 := timeShift_#t~ret109;havoc timeShift_#t~ret109; 2756#L2919-1true assume 0 != timeShift_~tmp~26; 2811#L2920-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4787#L2595-23true havoc __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_#t~ret165, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~29, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~29;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5948#L1960-5true __utac_acc__Specification1_spec__3_#t~ret160 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~29 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~29; 6468#L3352-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 6405#L3353-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6224#L1969-7true __utac_acc__Specification1_spec__3_#t~ret161 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret161;havoc __utac_acc__Specification1_spec__3_#t~ret161; 6771#L3357-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 144#L3412-1true cleanup_~i~2 := 1 + cleanup_~i~2; 6773#L714-2true [2019-01-01 23:17:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:17:37,044 INFO L82 PathProgramCache]: Analyzing trace with hash -745177872, now seen corresponding path program 1 times [2019-01-01 23:17:37,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:17:37,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:17:37,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:17:37,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:17:37,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:17:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:17:37,412 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-01 23:17:37,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:17:37,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:17:37,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:17:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:17:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1113299661, now seen corresponding path program 1 times [2019-01-01 23:17:37,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:17:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:17:37,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:17:37,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:17:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:17:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:17:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:17:38,228 WARN L181 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-01 23:17:39,505 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-01 23:17:39,518 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:17:39,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:17:39,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:17:39,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:17:39,520 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:17:39,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:39,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:17:39,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:17:39,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product30_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:17:39,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:17:39,521 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:17:39,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,794 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:17:39,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:39,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,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-01 23:17:40,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,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-01 23:17:40,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,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-01 23:17:40,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:40,808 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:17:41,078 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:17:41,079 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-01 23:17:41,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:41,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:41,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:41,114 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:17:41,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:41,151 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:41,175 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:41,175 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:41,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:41,232 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:17:41,243 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:41,244 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:17:41,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:41,285 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:41,294 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:17:41,295 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:41,328 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:17:41,328 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:17:41,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:17:41,385 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:53,641 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:17:53,644 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:17:53,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:17:53,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:17:53,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:17:53,645 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:17:53,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:17:53,645 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:17:53,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:17:53,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product30_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:17:53,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:17:53,646 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:17:53,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,902 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:17:53,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:53,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:17:54,696 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 23:17:55,279 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:17:55,526 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:17:55,531 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:17:55,532 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-01 23:17:55,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,541 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-01 23:17:55,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,544 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-01 23:17:55,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,547 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-01 23:17:55,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,548 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:17:55,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,550 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:17:55,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,564 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-01 23:17:55,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,567 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-01 23:17:55,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,571 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-01 23:17:55,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,574 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-01 23:17:55,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,585 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-01 23:17:55,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,591 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-01 23:17:55,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,600 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-01 23:17:55,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,601 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:17:55,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,603 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:17:55,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,614 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-01 23:17:55,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,618 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-01 23:17:55,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,621 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-01 23:17:55,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,624 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-01 23:17:55,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,627 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-01 23:17:55,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,630 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-01 23:17:55,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,634 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-01 23:17:55,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,637 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-01 23:17:55,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,638 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:17:55,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,639 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:17:55,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,658 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-01 23:17:55,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:17:55,667 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-01 23:17:55,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:17:55,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:17:55,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:17:55,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:17:55,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:17:55,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:17:55,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:17:55,675 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:17:55,684 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:17:55,684 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:17:55,687 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:17:55,687 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:17:55,687 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:17:55,688 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~2) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2019-01-01 23:17:55,689 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:17:55,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:17:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:17:55,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:17:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:17:55,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:17:56,063 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-01 23:17:56,083 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:17:56,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6902 states. Second operand 5 states. [2019-01-01 23:17:57,156 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6902 states.. Second operand 5 states. Result 10373 states and 19581 transitions. Complement of second has 9 states. [2019-01-01 23:17:57,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:17:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:17:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13098 transitions. [2019-01-01 23:17:57,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13098 transitions. Stem has 33 letters. Loop has 22 letters. [2019-01-01 23:17:57,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:17:57,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13098 transitions. Stem has 55 letters. Loop has 22 letters. [2019-01-01 23:17:57,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:17:57,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13098 transitions. Stem has 33 letters. Loop has 44 letters. [2019-01-01 23:17:57,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:17:57,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10373 states and 19581 transitions. [2019-01-01 23:17:57,322 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:17:57,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10373 states to 0 states and 0 transitions. [2019-01-01 23:17:57,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:17:57,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:17:57,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:17:57,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:17:57,329 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:17:57,330 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:17:57,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:17:57,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:17:57,335 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-01 23:17:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:17:57,339 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:17:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:17:57,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:17:57,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:17:57,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:17:57,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:17:57,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:17:57,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:17:57,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:17:57,341 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:17:57,341 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:17:57,341 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:17:57,341 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:17:57,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:17:57,341 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:17:57,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:17:57,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:17:57 BoogieIcfgContainer [2019-01-01 23:17:57,350 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:17:57,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:17:57,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:17:57,351 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:17:57,351 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:17:36" (3/4) ... [2019-01-01 23:17:57,356 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:17:57,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:17:57,358 INFO L168 Benchmark]: Toolchain (without parser) took 40184.76 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 638.6 MB). Free memory was 948.5 MB in the beginning and 1.3 GB in the end (delta: -398.5 MB). Peak memory consumption was 240.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:17:57,359 INFO L168 Benchmark]: CDTParser took 0.19 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-01 23:17:57,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1295.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:17:57,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 477.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:17:57,364 INFO L168 Benchmark]: Boogie Preprocessor took 445.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 965.9 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:17:57,365 INFO L168 Benchmark]: RCFGBuilder took 17103.37 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 500.7 MB). Free memory was 965.9 MB in the beginning and 1.4 GB in the end (delta: -412.5 MB). Peak memory consumption was 453.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:17:57,366 INFO L168 Benchmark]: BuchiAutomizer took 20848.61 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.0 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:17:57,367 INFO L168 Benchmark]: Witness Printer took 5.84 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:17:57,375 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.19 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 1295.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 477.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 445.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 965.9 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 17103.37 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 500.7 MB). Free memory was 965.9 MB in the beginning and 1.4 GB in the end (delta: -412.5 MB). Peak memory consumption was 453.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20848.61 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.0 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.84 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 18.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13064 SDtfs, 25979 SDslu, 6491 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...