./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec1_product28_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec1_product28_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 eec652bf33328ae8e48161905a6482e580dbdebd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:58:21,855 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:58:21,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:58:21,872 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:58:21,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:58:21,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:58:21,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:58:21,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:58:21,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:58:21,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:58:21,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:58:21,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:58:21,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:58:21,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:58:21,884 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:58:21,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:58:21,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:58:21,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:58:21,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:58:21,891 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:58:21,892 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:58:21,893 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:58:21,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:58:21,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:58:21,897 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:58:21,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:58:21,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:58:21,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:58:21,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:58:21,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:58:21,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:58:21,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:58:21,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:58:21,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:58:21,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:58:21,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:58:21,905 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:58:21,922 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:58:21,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:58:21,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:58:21,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:58:21,926 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:58:21,926 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:58:21,927 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:58:21,927 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:58:21,927 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:58:21,927 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:58:21,927 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:58:21,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:58:21,928 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:58:21,928 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:58:21,928 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:58:21,928 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:58:21,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:58:21,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:58:21,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:58:21,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:58:21,930 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:58:21,931 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:58:21,931 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:58:21,931 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:58:21,931 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:58:21,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:58:21,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:58:21,934 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:58:21,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:58:21,935 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:58:21,935 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:58:21,936 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:58:21,936 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 -> eec652bf33328ae8e48161905a6482e580dbdebd [2019-01-14 03:58:21,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:58:21,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:58:21,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:58:22,000 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:58:22,001 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:58:22,001 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec1_product28_false-unreach-call_true-termination.cil.c [2019-01-14 03:58:22,057 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb991d46/3a33ae6f115e4b44a55554b0bbfe07ad/FLAG1304acc08 [2019-01-14 03:58:22,703 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:58:22,704 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec1_product28_false-unreach-call_true-termination.cil.c [2019-01-14 03:58:22,723 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb991d46/3a33ae6f115e4b44a55554b0bbfe07ad/FLAG1304acc08 [2019-01-14 03:58:22,857 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb991d46/3a33ae6f115e4b44a55554b0bbfe07ad [2019-01-14 03:58:22,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:58:22,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:58:22,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:58:22,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:58:22,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:58:22,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:58:22" (1/1) ... [2019-01-14 03:58:22,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd00d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:22, skipping insertion in model container [2019-01-14 03:58:22,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:58:22" (1/1) ... [2019-01-14 03:58:22,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:58:22,985 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:58:23,705 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:58:23,730 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:58:23,995 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:58:24,066 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:58:24,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24 WrapperNode [2019-01-14 03:58:24,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:58:24,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:58:24,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:58:24,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:58:24,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... [2019-01-14 03:58:24,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... [2019-01-14 03:58:24,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:58:24,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:58:24,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:58:24,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:58:24,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... [2019-01-14 03:58:24,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... [2019-01-14 03:58:24,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... [2019-01-14 03:58:24,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... [2019-01-14 03:58:24,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... [2019-01-14 03:58:24,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... [2019-01-14 03:58:24,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... [2019-01-14 03:58:24,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:58:24,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:58:24,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:58:24,802 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:58:24,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:58:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 03:58:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:58:24,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:58:40,885 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:58:40,885 INFO L286 CfgBuilder]: Removed 1209 assue(true) statements. [2019-01-14 03:58:40,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:58:40 BoogieIcfgContainer [2019-01-14 03:58:40,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:58:40,890 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:58:40,890 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:58:40,894 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:58:40,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:58:40,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:58:22" (1/3) ... [2019-01-14 03:58:40,897 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b317d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:58:40, skipping insertion in model container [2019-01-14 03:58:40,897 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:58:40,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:58:24" (2/3) ... [2019-01-14 03:58:40,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b317d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:58:40, skipping insertion in model container [2019-01-14 03:58:40,898 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:58:40,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:58:40" (3/3) ... [2019-01-14 03:58:40,901 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product28_false-unreach-call_true-termination.cil.c [2019-01-14 03:58:40,964 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:58:40,965 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:58:40,965 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:58:40,965 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:58:40,965 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:58:40,965 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:58:40,965 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:58:40,965 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:58:40,966 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:58:41,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4978 states. [2019-01-14 03:58:41,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2449 [2019-01-14 03:58:41,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:58:41,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:58:41,286 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:58:41,286 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:58:41,286 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:58:41,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4978 states. [2019-01-14 03:58:41,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2449 [2019-01-14 03:58:41,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:58:41,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:58:41,367 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:58:41,368 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:58:41,375 INFO L794 eck$LassoCheckResult]: Stem: 3477#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~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;~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~string81.base, #t~string81.offset := #Ultimate.allocOnStack(10);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string83.base, #t~string83.offset, 1);call write~init~int(95, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(93, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 3 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string85.base, #t~string85.offset, 1);call write~init~int(93, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(32, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 3 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(97, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(116, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(32, #t~string87.base, 3 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 4 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string89.base, #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 2 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(10);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string93.base, #t~string93.offset, 1);call write~init~int(112, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string95.base, #t~string95.offset, 1);call write~init~int(111, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(119, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(110, #t~string95.base, 3 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 4 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(73, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(76, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 5 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 6 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string99.base, #t~string99.offset, 1);call write~init~int(37, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(105, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 3 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(70, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(95, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(112, #t~string109.base, 3 + #t~string109.offset, 1);call write~init~int(58, #t~string109.base, 4 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 5 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(37, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(105, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 3 + #t~string115.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string126.base, #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 1 + #t~string126.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(30);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(9);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(21);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(30);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(9);call #t~string155.base, #t~string155.offset := #Ultimate.allocOnStack(21);call #t~string159.base, #t~string159.offset := #Ultimate.allocOnStack(30);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(9);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(25);call #t~string162.base, #t~string162.offset := #Ultimate.allocOnStack(30);call #t~string163.base, #t~string163.offset := #Ultimate.allocOnStack(9);call #t~string164.base, #t~string164.offset := #Ultimate.allocOnStack(25); 4395#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~1, main_~tmp~8;havoc main_~retValue_acc~1;havoc main_~tmp~8; 4639#L545true havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 3346#L553true main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 3697#L389true assume 0 != main_~tmp~8; 4184#L358true ~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; 2964#L579true havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~3;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~3; 4973#L448true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~3 := 4;getOrigin_#res := getOrigin_~retValue_acc~3; 3978#L473true bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 3055#L1109true assume 0 == initPersonOnFloor_~floor; 2752#L1110true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 118#L1217-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; 2601#L586true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 59#L598-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 3994#L913-2true havoc angelinaCall_#t~ret3, angelinaCall_~tmp~2;havoc angelinaCall_~tmp~2;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~3;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~3; 4974#L448-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~3 := 4;getOrigin_#res := getOrigin_~retValue_acc~3; 3980#L473-1true angelinaCall_#t~ret3 := getOrigin_#res;angelinaCall_~tmp~2 := angelinaCall_#t~ret3;havoc angelinaCall_#t~ret3;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~2;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 3022#L1109-1true assume 0 == initPersonOnFloor_~floor; 2739#L1110-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1362#L1217-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; 2560#L586-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 70#L598-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 3989#L913-5true havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret80, timeShift_~tmp~24;havoc timeShift_~tmp~24;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 4261#L1763true timeShift_#t~ret80 := areDoorsOpen_#res;timeShift_~tmp~24 := timeShift_#t~ret80;havoc timeShift_#t~ret80; 812#L2705true assume 0 != timeShift_~tmp~24; 725#L2706true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4291#L2379-11true havoc __utac_acc__Specification1_spec__3_#t~ret15, __utac_acc__Specification1_spec__3_#t~ret16, __utac_acc__Specification1_spec__3_#t~ret17, __utac_acc__Specification1_spec__3_#t~ret18, __utac_acc__Specification1_spec__3_#t~ret19, __utac_acc__Specification1_spec__3_#t~ret20, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~9, __utac_acc__Specification1_spec__3_~tmp___0~2, __utac_acc__Specification1_spec__3_~tmp___1~1, __utac_acc__Specification1_spec__3_~tmp___2~1, __utac_acc__Specification1_spec__3_~tmp___3~0, __utac_acc__Specification1_spec__3_~tmp___4~0;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~9;havoc __utac_acc__Specification1_spec__3_~tmp___0~2;havoc __utac_acc__Specification1_spec__3_~tmp___1~1;havoc __utac_acc__Specification1_spec__3_~tmp___2~1;havoc __utac_acc__Specification1_spec__3_~tmp___3~0;havoc __utac_acc__Specification1_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 857#L1754-6true __utac_acc__Specification1_spec__3_#t~ret15 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~9 := __utac_acc__Specification1_spec__3_#t~ret15;havoc __utac_acc__Specification1_spec__3_#t~ret15;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~9; 4978#L624true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 4953#L625true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 4264#L1763-1true __utac_acc__Specification1_spec__3_#t~ret16 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~0 := __utac_acc__Specification1_spec__3_#t~ret16;havoc __utac_acc__Specification1_spec__3_#t~ret16; 4673#L629true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~0;~landingButtons_spc1_0~0 := 0; 200#L684true cleanup_~i~0 := 0; 4675#L188-2true [2019-01-14 03:58:41,383 INFO L796 eck$LassoCheckResult]: Loop: 4675#L188-2true assume !false; 4731#L189true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 4662#L192true assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~10; 4490#L1581true cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 3468#L196true assume 1 != cleanup_~tmp___0~0; 3467#L196-1true havoc isIdle_#res;havoc isIdle_#t~ret35, isIdle_~retValue_acc~17, isIdle_~tmp~16;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~16;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret30, anyStopRequested_#t~ret31, anyStopRequested_#t~ret32, anyStopRequested_#t~ret33, anyStopRequested_#t~ret34, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~15, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~15;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~7;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~7; 1881#L834-50true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~7 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~7; 53#L861-50true anyStopRequested_#t~ret30 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret30;havoc anyStopRequested_#t~ret30; 4674#L1862true assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 1230#L1926true isIdle_#t~ret35 := anyStopRequested_#res;isIdle_~tmp~16 := isIdle_#t~ret35;havoc isIdle_#t~ret35;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~16 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 4272#L1939true cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 3878#L208true assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret80, timeShift_~tmp~24;havoc timeShift_~tmp~24;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 4255#L1763-6true timeShift_#t~ret80 := areDoorsOpen_#res;timeShift_~tmp~24 := timeShift_#t~ret80;havoc timeShift_#t~ret80; 814#L2705-1true assume 0 != timeShift_~tmp~24; 737#L2706-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4253#L2379-23true havoc __utac_acc__Specification1_spec__3_#t~ret15, __utac_acc__Specification1_spec__3_#t~ret16, __utac_acc__Specification1_spec__3_#t~ret17, __utac_acc__Specification1_spec__3_#t~ret18, __utac_acc__Specification1_spec__3_#t~ret19, __utac_acc__Specification1_spec__3_#t~ret20, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~9, __utac_acc__Specification1_spec__3_~tmp___0~2, __utac_acc__Specification1_spec__3_~tmp___1~1, __utac_acc__Specification1_spec__3_~tmp___2~1, __utac_acc__Specification1_spec__3_~tmp___3~0, __utac_acc__Specification1_spec__3_~tmp___4~0;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~9;havoc __utac_acc__Specification1_spec__3_~tmp___0~2;havoc __utac_acc__Specification1_spec__3_~tmp___1~1;havoc __utac_acc__Specification1_spec__3_~tmp___2~1;havoc __utac_acc__Specification1_spec__3_~tmp___3~0;havoc __utac_acc__Specification1_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 849#L1754-13true __utac_acc__Specification1_spec__3_#t~ret15 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~9 := __utac_acc__Specification1_spec__3_#t~ret15;havoc __utac_acc__Specification1_spec__3_#t~ret15;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~9; 4979#L624-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 4954#L625-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 4258#L1763-7true __utac_acc__Specification1_spec__3_#t~ret16 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~0 := __utac_acc__Specification1_spec__3_#t~ret16;havoc __utac_acc__Specification1_spec__3_#t~ret16; 4669#L629-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~0;~landingButtons_spc1_0~0 := 0; 202#L684-1true cleanup_~i~0 := 1 + cleanup_~i~0; 4675#L188-2true [2019-01-14 03:58:41,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:58:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1138125382, now seen corresponding path program 1 times [2019-01-14 03:58:41,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:58:41,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:58:41,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:58:41,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:58:41,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:58:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:58:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:58:41,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:58:41,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:58:41,787 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:58:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:58:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash -118804279, now seen corresponding path program 1 times [2019-01-14 03:58:41,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:58:41,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:58:41,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:58:41,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:58:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:58:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:58:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:58:42,625 WARN L181 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-14 03:58:43,519 WARN L181 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-14 03:58:43,530 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:58:43,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:58:43,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:58:43,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:58:43,532 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:58:43,533 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:43,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:58:43,533 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:58:43,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product28_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 03:58:43,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:58:43,535 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:58:43,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:43,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:44,455 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 03:58:44,608 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:58:44,609 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:44,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:44,621 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:44,642 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:44,643 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:44,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:44,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:44,673 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:44,673 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret20=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret20=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) [2019-01-14 03:58:44,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:44,699 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:44,703 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:44,704 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret16=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret16=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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:44,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:44,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:44,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:44,744 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___3~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___3~0=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) [2019-01-14 03:58:44,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:44,806 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:44,818 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:44,819 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret35=0} Honda state: {ULTIMATE.start_isIdle_#t~ret35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:44,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:44,855 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:44,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:44,867 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret15=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:44,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:44,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:44,899 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:44,899 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~6=0, ULTIMATE.start_isIdle_~retValue_acc~17=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~6=0, ULTIMATE.start_isIdle_~retValue_acc~17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:45,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:45,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:45,058 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:45,059 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret80=0} Honda state: {ULTIMATE.start_timeShift_#t~ret80=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:45,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:45,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:45,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:45,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___4~0=-8, ~doorState~0=-8, ULTIMATE.start_timeShift_~tmp~24=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~12=-8} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start___utac_acc__Specification1_spec__3_~tmp___4~0=-8, ~doorState~0=-8, ULTIMATE.start_timeShift_~tmp~24=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~12=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:45,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:45,129 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:45,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:58:45,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:57,203 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:58:57,206 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:58:57,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:58:57,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:58:57,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:58:57,206 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:58:57,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:57,207 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:58:57,207 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:58:57,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product28_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 03:58:57,207 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:58:57,207 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:58:57,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,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-14 03:58:57,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,363 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 03:58:57,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,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-14 03:58:57,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:57,981 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 03:58:58,240 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 03:58:58,494 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 03:58:58,799 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:58:58,805 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:58:58,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:58,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:58,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:58,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:58,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,820 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:58:58,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,822 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:58:58,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:58,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:58,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:58,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:58,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,844 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:58:58,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,845 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:58:58,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:58,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:58,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:58,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:58,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:58,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:58,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:58,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:58,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:58,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:58,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:58,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:58,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:58,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:58,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:58,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:58,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:58,879 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:58:58,902 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:58:58,902 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:58:58,904 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:58:58,904 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:58:58,904 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:58:58,908 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2019-01-14 03:58:58,912 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:58:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:58:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:58:59,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:58:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:58:59,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:58:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:58:59,313 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-14 03:58:59,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4978 states. Second operand 5 states. [2019-01-14 03:59:00,200 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4978 states.. Second operand 5 states. Result 7487 states and 14049 transitions. Complement of second has 9 states. [2019-01-14 03:59:00,205 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-14 03:59:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 03:59:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9410 transitions. [2019-01-14 03:59:00,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9410 transitions. Stem has 33 letters. Loop has 22 letters. [2019-01-14 03:59:00,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:59:00,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9410 transitions. Stem has 55 letters. Loop has 22 letters. [2019-01-14 03:59:00,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:59:00,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9410 transitions. Stem has 33 letters. Loop has 44 letters. [2019-01-14 03:59:00,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:59:00,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7487 states and 14049 transitions. [2019-01-14 03:59:00,352 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:59:00,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7487 states to 0 states and 0 transitions. [2019-01-14 03:59:00,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:59:00,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:59:00,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:59:00,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:59:00,362 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:00,363 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:00,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:59:00,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:59:00,373 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 03:59:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:59:00,377 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 03:59:00,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:59:00,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 03:59:00,380 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:59:00,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 03:59:00,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:59:00,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:59:00,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:59:00,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:59:00,382 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:00,382 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:00,382 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:59:00,382 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:59:00,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:59:00,382 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:59:00,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:59:00,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:59:00 BoogieIcfgContainer [2019-01-14 03:59:00,399 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:59:00,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:59:00,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:59:00,400 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:59:00,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:58:40" (3/4) ... [2019-01-14 03:59:00,410 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:59:00,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:59:00,411 INFO L168 Benchmark]: Toolchain (without parser) took 37548.54 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 522.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 389.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:00,414 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:59:00,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1202.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:00,417 INFO L168 Benchmark]: Boogie Procedure Inliner took 370.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:00,419 INFO L168 Benchmark]: Boogie Preprocessor took 362.21 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:00,420 INFO L168 Benchmark]: RCFGBuilder took 16087.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -101.6 MB). Peak memory consumption was 443.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:00,423 INFO L168 Benchmark]: BuchiAutomizer took 19509.22 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 212.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:59:00,425 INFO L168 Benchmark]: Witness Printer took 10.37 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:59:00,433 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1202.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 370.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 362.21 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 16087.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -101.6 MB). Peak memory consumption was 443.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19509.22 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 212.4 MB. Max. memory is 11.5 GB. * Witness Printer took 10.37 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 19.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 17.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. 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: 9376 SDtfs, 13982 SDslu, 4647 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: 15ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...