./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product31_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec2_product31_true-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 5e4d8dcfe82fc4bb9ebaa5d0d7ffbdedfabac858 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:20:53,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:20:53,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:20:53,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:20:53,958 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:20:53,959 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:20:53,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:20:53,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:20:53,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:20:53,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:20:53,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:20:53,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:20:53,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:20:53,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:20:53,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:20:53,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:20:53,972 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:20:53,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:20:53,976 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:20:53,978 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:20:53,979 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:20:53,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:20:53,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:20:53,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:20:53,983 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:20:53,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:20:53,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:20:53,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:20:53,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:20:53,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:20:53,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:20:53,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:20:53,990 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:20:53,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:20:53,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:20:53,992 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:20:53,993 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:20:54,009 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:20:54,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:20:54,011 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:20:54,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:20:54,011 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:20:54,012 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:20:54,012 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:20:54,013 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:20:54,013 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:20:54,013 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:20:54,013 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:20:54,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:20:54,013 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:20:54,014 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:20:54,014 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:20:54,014 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:20:54,014 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:20:54,014 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:20:54,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:20:54,016 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:20:54,016 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:20:54,016 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:20:54,016 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:20:54,017 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:20:54,017 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:20:54,017 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:20:54,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:20:54,017 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:20:54,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:20:54,019 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:20:54,019 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:20:54,020 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:20:54,020 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 -> 5e4d8dcfe82fc4bb9ebaa5d0d7ffbdedfabac858 [2019-01-01 23:20:54,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:20:54,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:20:54,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:20:54,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:20:54,073 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:20:54,074 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product31_true-unreach-call_true-termination.cil.c [2019-01-01 23:20:54,138 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dfe4ef57/6ce38158c21042e98c73cb22b6163c79/FLAGf4a56eacb [2019-01-01 23:20:54,753 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:20:54,753 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product31_true-unreach-call_true-termination.cil.c [2019-01-01 23:20:54,773 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dfe4ef57/6ce38158c21042e98c73cb22b6163c79/FLAGf4a56eacb [2019-01-01 23:20:54,930 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dfe4ef57/6ce38158c21042e98c73cb22b6163c79 [2019-01-01 23:20:54,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:20:54,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:20:54,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:20:54,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:20:54,945 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:20:54,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:20:54" (1/1) ... [2019-01-01 23:20:54,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9c6855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:54, skipping insertion in model container [2019-01-01 23:20:54,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:20:54" (1/1) ... [2019-01-01 23:20:54,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:20:55,041 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:20:55,728 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:20:55,751 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:20:55,978 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:20:56,050 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:20:56,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56 WrapperNode [2019-01-01 23:20:56,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:20:56,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:20:56,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:20:56,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:20:56,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... [2019-01-01 23:20:56,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... [2019-01-01 23:20:56,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:20:56,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:20:56,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:20:56,378 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:20:56,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... [2019-01-01 23:20:56,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... [2019-01-01 23:20:56,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... [2019-01-01 23:20:56,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... [2019-01-01 23:20:56,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... [2019-01-01 23:20:56,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... [2019-01-01 23:20:56,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... [2019-01-01 23:20:56,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:20:56,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:20:56,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:20:56,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:20:56,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:56,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:20:56,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:20:56,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:20:56,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:21:09,338 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:21:09,339 INFO L280 CfgBuilder]: Removed 893 assue(true) statements. [2019-01-01 23:21:09,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:21:09 BoogieIcfgContainer [2019-01-01 23:21:09,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:21:09,340 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:21:09,340 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:21:09,344 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:21:09,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:21:09,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:20:54" (1/3) ... [2019-01-01 23:21:09,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b70e607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:21:09, skipping insertion in model container [2019-01-01 23:21:09,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:21:09,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:56" (2/3) ... [2019-01-01 23:21:09,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b70e607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:21:09, skipping insertion in model container [2019-01-01 23:21:09,348 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:21:09,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:21:09" (3/3) ... [2019-01-01 23:21:09,350 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product31_true-unreach-call_true-termination.cil.c [2019-01-01 23:21:09,417 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:21:09,418 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:21:09,418 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:21:09,418 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:21:09,418 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:21:09,418 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:21:09,418 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:21:09,418 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:21:09,419 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:21:09,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3671 states. [2019-01-01 23:21:09,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1825 [2019-01-01 23:21:09,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:21:09,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:21:09,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:09,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:09,687 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:21:09,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3671 states. [2019-01-01 23:21:09,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1825 [2019-01-01 23:21:09,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:21:09,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:21:09,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:09,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:09,751 INFO L794 eck$LassoCheckResult]: Stem: 2399#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[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;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~cleanupTimeShifts~0 := 12;~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~string86.base, #t~string86.offset := #Ultimate.allocOnStack(10);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string88.base, #t~string88.offset, 1);call write~init~int(95, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(93, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string90.base, #t~string90.offset, 1);call write~init~int(93, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(32, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(97, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(116, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(32, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 4 + #t~string92.offset, 1);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string94.base, #t~string94.offset, 1);call write~init~int(105, #t~string94.base, 1 + #t~string94.offset, 1);call write~init~int(0, #t~string94.base, 2 + #t~string94.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(10);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string98.base, #t~string98.offset, 1);call write~init~int(112, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 2 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string100.base, #t~string100.offset, 1);call write~init~int(111, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(119, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(110, #t~string100.base, 3 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 4 + #t~string100.offset, 1);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string102.base, #t~string102.offset, 1);call write~init~int(73, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(76, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 3 + #t~string102.offset, 1);call write~init~int(112, #t~string102.base, 4 + #t~string102.offset, 1);call write~init~int(58, #t~string102.base, 5 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 6 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string108.base, #t~string108.offset, 1);call write~init~int(37, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 2 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 3 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string110.base, #t~string110.offset, 1);call write~init~int(37, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(105, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.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~string114.base, #t~string114.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(70, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(95, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(112, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(58, #t~string114.base, 4 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 5 + #t~string114.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string117.base, #t~string117.offset, 1);call write~init~int(37, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 2 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 3 + #t~string117.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string123.base, #t~string123.offset, 1);call write~init~int(37, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(105, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(37, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 3 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string131.base, #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 1 + #t~string131.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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~string156.base, #t~string156.offset := #Ultimate.allocOnStack(30);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(21);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);call #t~string165.base, #t~string165.offset := #Ultimate.allocOnStack(30);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(9);call #t~string167.base, #t~string167.offset := #Ultimate.allocOnStack(25); 2978#L-1true havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~7, main_~tmp~11;havoc main_~retValue_acc~7;havoc main_~tmp~11; 2309#L3104true havoc valid_product_#res;havoc valid_product_~retValue_acc~28;havoc valid_product_~retValue_acc~28;valid_product_~retValue_acc~28 := 1;valid_product_#res := valid_product_~retValue_acc~28; 2787#L3112true main_#t~ret25 := valid_product_#res;main_~tmp~11 := main_#t~ret25;havoc main_#t~ret25; 1254#L1453true assume 0 != main_~tmp~11; 3308#L1424true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1819#L848true havoc bigMacCall_#t~ret18, bigMacCall_~tmp~8;havoc bigMacCall_~tmp~8;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 812#L753true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 739#L778true bigMacCall_#t~ret18 := getOrigin_#res;bigMacCall_~tmp~8 := bigMacCall_#t~ret18;havoc bigMacCall_#t~ret18;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~8;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1045#L399true assume 0 == initPersonOnFloor_~floor; 862#L400true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 223#L507-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 3296#L191true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 2190#L203-2true havoc cleanup_#t~ret19, cleanup_#t~ret20, cleanup_~i~2, cleanup_~tmp~9, cleanup_~tmp___0~3, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~9;havoc cleanup_~tmp___0~3;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret75, timeShift_#t~ret76, timeShift_#t~ret77, timeShift_#t~ret78, timeShift_#t~ret79, timeShift_#t~ret80, timeShift_#t~ret81, timeShift_#t~ret82, timeShift_#t~ret83, timeShift_#t~ret84, timeShift_#t~ret85, timeShift_~tmp~25, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret59, stopRequestedAtCurrentFloor_#t~ret60, stopRequestedAtCurrentFloor_#t~ret61, stopRequestedAtCurrentFloor_#t~ret62, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1323#L128true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 195#L155true isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 746#L3068true stopRequestedAtCurrentFloor_#t~ret59 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret59;havoc stopRequestedAtCurrentFloor_#t~ret59; 763#L2453true assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1127#L1716true stopRequestedAtCurrentFloor_#t~ret60 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret60;havoc stopRequestedAtCurrentFloor_#t~ret60; 542#L2457true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 2903#L2470true timeShift_#t~ret75 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret75;havoc timeShift_#t~ret75; 1930#L2605true assume !(0 != timeShift_~tmp___9~2); 1753#L2696true assume !(1 == ~doorState~0); 1755#L2696-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret50, stopRequestedInDirection_#t~ret51, stopRequestedInDirection_#t~ret52, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~18, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~18;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1294#L128-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 211#L155-3true isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 744#L3068-1true stopRequestedInDirection_#t~ret50 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret50;havoc stopRequestedInDirection_#t~ret50; 2482#L2308true assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1136#L1716-3true stopRequestedInDirection_#t~ret51 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret51;havoc stopRequestedInDirection_#t~ret51;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~18 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~18; 2773#L2321true timeShift_#t~ret82 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret82;havoc timeShift_#t~ret82; 411#L2704true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret53, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 672#L2365true assume !(1 == ~currentHeading~0); 3242#L2375true assume !(0 == ~currentFloorID~0); 3246#L2375-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 2966#L2381-5true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1137#L1716-5true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 3371#L893true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 3451#L894true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 2059#L1725true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 2520#L898true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 756#L953true cleanup_~i~2 := 0; 2219#L1256-2true [2019-01-01 23:21:09,768 INFO L796 eck$LassoCheckResult]: Loop: 2219#L1256-2true assume !false; 2297#L1257true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 2205#L1260true assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := 0;isBlocked_#res := isBlocked_~retValue_acc~8; 1342#L1539true cleanup_#t~ret19 := isBlocked_#res;cleanup_~tmp___0~3 := cleanup_#t~ret19;havoc cleanup_#t~ret19; 2775#L1264true assume 1 != cleanup_~tmp___0~3; 2778#L1264-1true havoc isIdle_#res;havoc isIdle_#t~ret34, isIdle_~retValue_acc~15, isIdle_~tmp~16;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~16;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret29, anyStopRequested_#t~ret30, anyStopRequested_#t~ret31, anyStopRequested_#t~ret32, anyStopRequested_#t~ret33, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~15, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~14;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~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1175#L128-65true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 226#L155-65true anyStopRequested_#t~ret29 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret29;havoc anyStopRequested_#t~ret29; 387#L1824true assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 2649#L1888true isIdle_#t~ret34 := anyStopRequested_#res;isIdle_~tmp~16 := isIdle_#t~ret34;havoc isIdle_#t~ret34;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~16 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 1902#L1901true cleanup_#t~ret20 := isIdle_#res;cleanup_~tmp~9 := cleanup_#t~ret20;havoc cleanup_#t~ret20; 1101#L1276true assume !(0 != cleanup_~tmp~9);havoc timeShift_#t~ret75, timeShift_#t~ret76, timeShift_#t~ret77, timeShift_#t~ret78, timeShift_#t~ret79, timeShift_#t~ret80, timeShift_#t~ret81, timeShift_#t~ret82, timeShift_#t~ret83, timeShift_#t~ret84, timeShift_#t~ret85, timeShift_~tmp~25, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret59, stopRequestedAtCurrentFloor_#t~ret60, stopRequestedAtCurrentFloor_#t~ret61, stopRequestedAtCurrentFloor_#t~ret62, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1142#L128-70true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 242#L155-70true isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 731#L3068-3true stopRequestedAtCurrentFloor_#t~ret59 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret59;havoc stopRequestedAtCurrentFloor_#t~ret59; 668#L2453-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1108#L1716-6true stopRequestedAtCurrentFloor_#t~ret60 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret60;havoc stopRequestedAtCurrentFloor_#t~ret60; 544#L2457-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 2907#L2470-1true timeShift_#t~ret75 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret75;havoc timeShift_#t~ret75; 1933#L2605-1true assume !(0 != timeShift_~tmp___9~2); 1758#L2696-3true assume 1 == ~doorState~0;~doorState~0 := 0; 1737#L2696-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret50, stopRequestedInDirection_#t~ret51, stopRequestedInDirection_#t~ret52, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~18, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~18;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 1154#L128-73true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 68#L155-73true isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 736#L3068-4true stopRequestedInDirection_#t~ret50 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret50;havoc stopRequestedInDirection_#t~ret50; 2484#L2308-2true assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1116#L1716-9true stopRequestedInDirection_#t~ret51 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret51;havoc stopRequestedInDirection_#t~ret51;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~18 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~18; 2776#L2321-2true timeShift_#t~ret82 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret82;havoc timeShift_#t~ret82; 410#L2704-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret53, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 679#L2365-3true assume !(1 == ~currentHeading~0); 3220#L2375-9true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 3225#L2375-11true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 2965#L2381-11true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1094#L1716-11true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 3373#L893-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 3452#L894-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 2049#L1725-5true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 2521#L898-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 757#L953-1true cleanup_~i~2 := 1 + cleanup_~i~2; 2219#L1256-2true [2019-01-01 23:21:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1882106937, now seen corresponding path program 1 times [2019-01-01 23:21:09,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:21:09,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:21:09,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:09,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:21:09,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:21:10,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:21:10,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:21:10,172 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:21:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash 394659546, now seen corresponding path program 1 times [2019-01-01 23:21:10,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:21:10,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:21:10,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:10,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:21:10,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:21:10,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:21:10,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:21:10,419 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:21:10,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:21:10,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:21:10,436 INFO L87 Difference]: Start difference. First operand 3671 states. Second operand 7 states. [2019-01-01 23:21:10,996 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:21:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:21:25,403 INFO L93 Difference]: Finished difference Result 31176 states and 58243 transitions. [2019-01-01 23:21:25,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 23:21:25,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31176 states and 58243 transitions. [2019-01-01 23:21:25,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13613 [2019-01-01 23:21:25,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31176 states to 31036 states and 58085 transitions. [2019-01-01 23:21:25,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31036 [2019-01-01 23:21:26,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31036 [2019-01-01 23:21:26,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31036 states and 58085 transitions. [2019-01-01 23:21:26,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:21:26,078 INFO L705 BuchiCegarLoop]: Abstraction has 31036 states and 58085 transitions. [2019-01-01 23:21:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31036 states and 58085 transitions. [2019-01-01 23:21:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31036 to 10466. [2019-01-01 23:21:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10466 states. [2019-01-01 23:21:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10466 states to 10466 states and 19626 transitions. [2019-01-01 23:21:26,510 INFO L728 BuchiCegarLoop]: Abstraction has 10466 states and 19626 transitions. [2019-01-01 23:21:26,510 INFO L608 BuchiCegarLoop]: Abstraction has 10466 states and 19626 transitions. [2019-01-01 23:21:26,510 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:21:26,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10466 states and 19626 transitions. [2019-01-01 23:21:26,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5290 [2019-01-01 23:21:26,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:21:26,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:21:26,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:26,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:26,564 INFO L794 eck$LassoCheckResult]: Stem: 37992#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[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;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~cleanupTimeShifts~0 := 12;~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~string86.base, #t~string86.offset := #Ultimate.allocOnStack(10);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string88.base, #t~string88.offset, 1);call write~init~int(95, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(93, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string90.base, #t~string90.offset, 1);call write~init~int(93, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(32, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(97, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(116, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(32, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 4 + #t~string92.offset, 1);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string94.base, #t~string94.offset, 1);call write~init~int(105, #t~string94.base, 1 + #t~string94.offset, 1);call write~init~int(0, #t~string94.base, 2 + #t~string94.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(10);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string98.base, #t~string98.offset, 1);call write~init~int(112, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 2 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string100.base, #t~string100.offset, 1);call write~init~int(111, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(119, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(110, #t~string100.base, 3 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 4 + #t~string100.offset, 1);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string102.base, #t~string102.offset, 1);call write~init~int(73, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(76, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 3 + #t~string102.offset, 1);call write~init~int(112, #t~string102.base, 4 + #t~string102.offset, 1);call write~init~int(58, #t~string102.base, 5 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 6 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string108.base, #t~string108.offset, 1);call write~init~int(37, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 2 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 3 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string110.base, #t~string110.offset, 1);call write~init~int(37, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(105, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.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~string114.base, #t~string114.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(70, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(95, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(112, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(58, #t~string114.base, 4 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 5 + #t~string114.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string117.base, #t~string117.offset, 1);call write~init~int(37, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 2 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 3 + #t~string117.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string123.base, #t~string123.offset, 1);call write~init~int(37, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(105, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(37, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 3 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string131.base, #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 1 + #t~string131.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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~string156.base, #t~string156.offset := #Ultimate.allocOnStack(30);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(21);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);call #t~string165.base, #t~string165.offset := #Ultimate.allocOnStack(30);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(9);call #t~string167.base, #t~string167.offset := #Ultimate.allocOnStack(25); 37993#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~7, main_~tmp~11;havoc main_~retValue_acc~7;havoc main_~tmp~11; 37880#L3104 havoc valid_product_#res;havoc valid_product_~retValue_acc~28;havoc valid_product_~retValue_acc~28;valid_product_~retValue_acc~28 := 1;valid_product_#res := valid_product_~retValue_acc~28; 37881#L3112 main_#t~ret25 := valid_product_#res;main_~tmp~11 := main_#t~ret25;havoc main_#t~ret25; 36909#L1453 assume 0 != main_~tmp~11; 36910#L1424 ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 37399#L848 havoc bigMacCall_#t~ret18, bigMacCall_~tmp~8;havoc bigMacCall_~tmp~8;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 36224#L753 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 35492#L778 bigMacCall_#t~ret18 := getOrigin_#res;bigMacCall_~tmp~8 := bigMacCall_#t~ret18;havoc bigMacCall_#t~ret18;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~8;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 36148#L399 assume 0 == initPersonOnFloor_~floor; 36338#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 34925#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 35387#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 37739#L203-2 havoc cleanup_#t~ret19, cleanup_#t~ret20, cleanup_~i~2, cleanup_~tmp~9, cleanup_~tmp___0~3, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~9;havoc cleanup_~tmp___0~3;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret75, timeShift_#t~ret76, timeShift_#t~ret77, timeShift_#t~ret78, timeShift_#t~ret79, timeShift_#t~ret80, timeShift_#t~ret81, timeShift_#t~ret82, timeShift_#t~ret83, timeShift_#t~ret84, timeShift_#t~ret85, timeShift_~tmp~25, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret59, stopRequestedAtCurrentFloor_#t~ret60, stopRequestedAtCurrentFloor_#t~ret61, stopRequestedAtCurrentFloor_#t~ret62, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 36965#L128 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 35336#L155 isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 35337#L3068 stopRequestedAtCurrentFloor_#t~ret59 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret59;havoc stopRequestedAtCurrentFloor_#t~ret59; 36170#L2453 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 36172#L1716 stopRequestedAtCurrentFloor_#t~ret60 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret60;havoc stopRequestedAtCurrentFloor_#t~ret60; 35919#L2457 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 35921#L2470 timeShift_#t~ret75 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret75;havoc timeShift_#t~ret75; 43640#L2605 assume !(0 != timeShift_~tmp___9~2); 43641#L2696 assume !(1 == ~doorState~0); 44865#L2696-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret50, stopRequestedInDirection_#t~ret51, stopRequestedInDirection_#t~ret52, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~18, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~18;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 44864#L128-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 44863#L155-3 isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 44862#L3068-1 stopRequestedInDirection_#t~ret50 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret50;havoc stopRequestedInDirection_#t~ret50; 44860#L2308 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 44858#L1716-3 stopRequestedInDirection_#t~ret51 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret51;havoc stopRequestedInDirection_#t~ret51;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~18 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~18; 44857#L2321 timeShift_#t~ret82 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret82;havoc timeShift_#t~ret82; 44856#L2704 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret53, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 36096#L2365 assume !(1 == ~currentHeading~0); 36097#L2375 assume !(0 == ~currentFloorID~0); 35927#L2375-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 37665#L2381-5 havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 36814#L1716-5 __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 36815#L893 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 38665#L894 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 37490#L1725 __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 37491#L898 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 43024#L953 cleanup_~i~2 := 0; 43022#L1256-2 [2019-01-01 23:21:26,565 INFO L796 eck$LassoCheckResult]: Loop: 43022#L1256-2 assume !false; 43021#L1257 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 43016#L1260 assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := 0;isBlocked_#res := isBlocked_~retValue_acc~8; 43014#L1539 cleanup_#t~ret19 := isBlocked_#res;cleanup_~tmp___0~3 := cleanup_#t~ret19;havoc cleanup_#t~ret19; 42999#L1264 assume 1 != cleanup_~tmp___0~3; 42995#L1264-1 havoc isIdle_#res;havoc isIdle_#t~ret34, isIdle_~retValue_acc~15, isIdle_~tmp~16;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~16;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret29, anyStopRequested_#t~ret30, anyStopRequested_#t~ret31, anyStopRequested_#t~ret32, anyStopRequested_#t~ret33, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~15, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~14;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~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 36845#L128-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 36846#L155-65 anyStopRequested_#t~ret29 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret29;havoc anyStopRequested_#t~ret29; 35646#L1824 assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 35578#L1888 isIdle_#t~ret34 := anyStopRequested_#res;isIdle_~tmp~16 := isIdle_#t~ret34;havoc isIdle_#t~ret34;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~16 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 37468#L1901 cleanup_#t~ret20 := isIdle_#res;cleanup_~tmp~9 := cleanup_#t~ret20;havoc cleanup_#t~ret20; 36764#L1276 assume !(0 != cleanup_~tmp~9);havoc timeShift_#t~ret75, timeShift_#t~ret76, timeShift_#t~ret77, timeShift_#t~ret78, timeShift_#t~ret79, timeShift_#t~ret80, timeShift_#t~ret81, timeShift_#t~ret82, timeShift_#t~ret83, timeShift_#t~ret84, timeShift_#t~ret85, timeShift_~tmp~25, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret59, stopRequestedAtCurrentFloor_#t~ret60, stopRequestedAtCurrentFloor_#t~ret61, stopRequestedAtCurrentFloor_#t~ret62, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 36765#L128-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 38854#L155-70 isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 40947#L3068-3 stopRequestedAtCurrentFloor_#t~ret59 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret59;havoc stopRequestedAtCurrentFloor_#t~ret59; 40945#L2453-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 39179#L1716-6 stopRequestedAtCurrentFloor_#t~ret60 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret60;havoc stopRequestedAtCurrentFloor_#t~ret60; 39180#L2457-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 35924#L2470-1 timeShift_#t~ret75 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret75;havoc timeShift_#t~ret75; 44738#L2605-1 assume !(0 != timeShift_~tmp___9~2); 44739#L2696-3 assume 1 == ~doorState~0;~doorState~0 := 0; 45010#L2696-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret50, stopRequestedInDirection_#t~ret51, stopRequestedInDirection_#t~ret52, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~18, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~18;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 45009#L128-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 45008#L155-73 isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 45007#L3068-4 stopRequestedInDirection_#t~ret50 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret50;havoc stopRequestedInDirection_#t~ret50; 45006#L2308-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 36783#L1716-9 stopRequestedInDirection_#t~ret51 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret51;havoc stopRequestedInDirection_#t~ret51;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~18 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~18; 36784#L2321-2 timeShift_#t~ret82 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret82;havoc timeShift_#t~ret82; 35669#L2704-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret53, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 35671#L2365-3 assume !(1 == ~currentHeading~0); 36105#L2375-9 assume !(0 == ~currentFloorID~0); 36013#L2375-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 37682#L2381-11 havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 43822#L1716-11 __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 43820#L893-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 43819#L894-1 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 43811#L1725-5 __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 43027#L898-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 43023#L953-1 cleanup_~i~2 := 1 + cleanup_~i~2; 43022#L1256-2 [2019-01-01 23:21:26,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:26,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1882106937, now seen corresponding path program 2 times [2019-01-01 23:21:26,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:21:26,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:21:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:26,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:21:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:21:26,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:21:26,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:21:26,762 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:21:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1074717916, now seen corresponding path program 1 times [2019-01-01 23:21:26,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:21:26,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:21:26,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:26,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:21:26,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:21:26,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:21:26,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:21:26,941 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:21:26,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:21:26,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:21:26,942 INFO L87 Difference]: Start difference. First operand 10466 states and 19626 transitions. cyclomatic complexity: 9162 Second operand 5 states. [2019-01-01 23:21:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:21:28,011 INFO L93 Difference]: Finished difference Result 35975 states and 67246 transitions. [2019-01-01 23:21:28,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 23:21:28,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35975 states and 67246 transitions. [2019-01-01 23:21:28,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28369 [2019-01-01 23:21:28,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35975 states to 35975 states and 67246 transitions. [2019-01-01 23:21:28,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35975 [2019-01-01 23:21:28,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35975 [2019-01-01 23:21:28,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35975 states and 67246 transitions. [2019-01-01 23:21:28,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:21:28,715 INFO L705 BuchiCegarLoop]: Abstraction has 35975 states and 67246 transitions. [2019-01-01 23:21:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35975 states and 67246 transitions. [2019-01-01 23:21:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35975 to 15343. [2019-01-01 23:21:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15343 states. [2019-01-01 23:21:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15343 states to 15343 states and 28668 transitions. [2019-01-01 23:21:29,097 INFO L728 BuchiCegarLoop]: Abstraction has 15343 states and 28668 transitions. [2019-01-01 23:21:29,097 INFO L608 BuchiCegarLoop]: Abstraction has 15343 states and 28668 transitions. [2019-01-01 23:21:29,097 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:21:29,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15343 states and 28668 transitions. [2019-01-01 23:21:29,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7836 [2019-01-01 23:21:29,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:21:29,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:21:29,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:29,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:29,148 INFO L794 eck$LassoCheckResult]: Stem: 84556#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[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;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~cleanupTimeShifts~0 := 12;~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~string86.base, #t~string86.offset := #Ultimate.allocOnStack(10);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string88.base, #t~string88.offset, 1);call write~init~int(95, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(93, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string90.base, #t~string90.offset, 1);call write~init~int(93, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(32, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(97, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(116, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(32, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 4 + #t~string92.offset, 1);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string94.base, #t~string94.offset, 1);call write~init~int(105, #t~string94.base, 1 + #t~string94.offset, 1);call write~init~int(0, #t~string94.base, 2 + #t~string94.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(10);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string98.base, #t~string98.offset, 1);call write~init~int(112, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 2 + #t~string98.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string100.base, #t~string100.offset, 1);call write~init~int(111, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(119, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(110, #t~string100.base, 3 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 4 + #t~string100.offset, 1);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string102.base, #t~string102.offset, 1);call write~init~int(73, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(76, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 3 + #t~string102.offset, 1);call write~init~int(112, #t~string102.base, 4 + #t~string102.offset, 1);call write~init~int(58, #t~string102.base, 5 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 6 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string108.base, #t~string108.offset, 1);call write~init~int(37, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 2 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 3 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string110.base, #t~string110.offset, 1);call write~init~int(37, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(105, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.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~string114.base, #t~string114.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(70, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(95, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(112, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(58, #t~string114.base, 4 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 5 + #t~string114.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string117.base, #t~string117.offset, 1);call write~init~int(37, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 2 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 3 + #t~string117.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string123.base, #t~string123.offset, 1);call write~init~int(37, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(105, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(37, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 3 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string131.base, #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 1 + #t~string131.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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~string156.base, #t~string156.offset := #Ultimate.allocOnStack(30);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(21);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);call #t~string165.base, #t~string165.offset := #Ultimate.allocOnStack(30);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(9);call #t~string167.base, #t~string167.offset := #Ultimate.allocOnStack(25); 84557#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~7, main_~tmp~11;havoc main_~retValue_acc~7;havoc main_~tmp~11; 84452#L3104 havoc valid_product_#res;havoc valid_product_~retValue_acc~28;havoc valid_product_~retValue_acc~28;valid_product_~retValue_acc~28 := 1;valid_product_#res := valid_product_~retValue_acc~28; 84453#L3112 main_#t~ret25 := valid_product_#res;main_~tmp~11 := main_#t~ret25;havoc main_#t~ret25; 83407#L1453 assume 0 != main_~tmp~11; 83408#L1424 ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 83949#L848 havoc bigMacCall_#t~ret18, bigMacCall_~tmp~8;havoc bigMacCall_~tmp~8;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~4;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~4; 82703#L753 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~4 := 4;getOrigin_#res := getOrigin_~retValue_acc~4; 81956#L778 bigMacCall_#t~ret18 := getOrigin_#res;bigMacCall_~tmp~8 := bigMacCall_#t~ret18;havoc bigMacCall_#t~ret18;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~8;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 82605#L399 assume 0 == initPersonOnFloor_~floor; 82818#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 81390#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 81848#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 84299#L203-2 havoc cleanup_#t~ret19, cleanup_#t~ret20, cleanup_~i~2, cleanup_~tmp~9, cleanup_~tmp___0~3, cleanup_~__cil_tmp4~0;havoc cleanup_~i~2;havoc cleanup_~tmp~9;havoc cleanup_~tmp___0~3;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret75, timeShift_#t~ret76, timeShift_#t~ret77, timeShift_#t~ret78, timeShift_#t~ret79, timeShift_#t~ret80, timeShift_#t~ret81, timeShift_#t~ret82, timeShift_#t~ret83, timeShift_#t~ret84, timeShift_#t~ret85, timeShift_~tmp~25, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret59, stopRequestedAtCurrentFloor_#t~ret60, stopRequestedAtCurrentFloor_#t~ret61, stopRequestedAtCurrentFloor_#t~ret62, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 83476#L128 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 81797#L155 isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 81798#L3068 stopRequestedAtCurrentFloor_#t~ret59 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret59;havoc stopRequestedAtCurrentFloor_#t~ret59; 82618#L2453 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 82637#L1716 stopRequestedAtCurrentFloor_#t~ret60 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret60;havoc stopRequestedAtCurrentFloor_#t~ret60; 82380#L2457 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 82382#L2470 timeShift_#t~ret75 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret75;havoc timeShift_#t~ret75; 84964#L2605 assume !(0 != timeShift_~tmp___9~2); 83912#L2696 assume !(1 == ~doorState~0); 83914#L2696-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret50, stopRequestedInDirection_#t~ret51, stopRequestedInDirection_#t~ret52, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~18, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~18;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 85745#L128-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 85746#L155-3 isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 85741#L3068-1 stopRequestedInDirection_#t~ret50 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret50;havoc stopRequestedInDirection_#t~ret50; 85742#L2308 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 83302#L1716-3 stopRequestedInDirection_#t~ret51 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret51;havoc stopRequestedInDirection_#t~ret51;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~18 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~18; 83303#L2321 timeShift_#t~ret82 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret82;havoc timeShift_#t~ret82; 82134#L2704 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret53, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 82135#L2365 assume !(1 == ~currentHeading~0); 85259#L2375 assume !(0 == ~currentFloorID~0); 82388#L2375-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 92545#L2381-5 havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 92544#L1716-5 __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 92543#L893 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 92542#L894 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 92541#L1725 __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 92538#L898 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 92540#L953 cleanup_~i~2 := 0; 95189#L1256-2 [2019-01-01 23:21:29,148 INFO L796 eck$LassoCheckResult]: Loop: 95189#L1256-2 assume !false; 95188#L1257 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 95187#L1260 assume cleanup_~i~2 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := 0;isBlocked_#res := isBlocked_~retValue_acc~8; 95186#L1539 cleanup_#t~ret19 := isBlocked_#res;cleanup_~tmp___0~3 := cleanup_#t~ret19;havoc cleanup_#t~ret19; 95185#L1264 assume 1 != cleanup_~tmp___0~3; 95184#L1264-1 havoc isIdle_#res;havoc isIdle_#t~ret34, isIdle_~retValue_acc~15, isIdle_~tmp~16;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~16;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret29, anyStopRequested_#t~ret30, anyStopRequested_#t~ret31, anyStopRequested_#t~ret32, anyStopRequested_#t~ret33, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~15, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~14;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~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 95183#L128-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 95182#L155-65 anyStopRequested_#t~ret29 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret29;havoc anyStopRequested_#t~ret29; 92483#L1824 assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 92478#L1888 isIdle_#t~ret34 := anyStopRequested_#res;isIdle_~tmp~16 := isIdle_#t~ret34;havoc isIdle_#t~ret34;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~16 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 92477#L1901 cleanup_#t~ret20 := isIdle_#res;cleanup_~tmp~9 := cleanup_#t~ret20;havoc cleanup_#t~ret20; 92476#L1276 assume !(0 != cleanup_~tmp~9);havoc timeShift_#t~ret75, timeShift_#t~ret76, timeShift_#t~ret77, timeShift_#t~ret78, timeShift_#t~ret79, timeShift_#t~ret80, timeShift_#t~ret81, timeShift_#t~ret82, timeShift_#t~ret83, timeShift_#t~ret84, timeShift_#t~ret85, timeShift_~tmp~25, timeShift_~tmp___0~12, timeShift_~tmp___1~7, timeShift_~tmp___2~5, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~12;havoc timeShift_~tmp___1~7;havoc timeShift_~tmp___2~5;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret59, stopRequestedAtCurrentFloor_#t~ret60, stopRequestedAtCurrentFloor_#t~ret61, stopRequestedAtCurrentFloor_#t~ret62, stopRequestedAtCurrentFloor_~retValue_acc~22, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~10;havoc stopRequestedAtCurrentFloor_~retValue_acc~22;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~10;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 92475#L128-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 86529#L155-70 isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 92471#L3068-3 stopRequestedAtCurrentFloor_#t~ret59 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret59;havoc stopRequestedAtCurrentFloor_#t~ret59; 92469#L2453-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 92468#L1716-6 stopRequestedAtCurrentFloor_#t~ret60 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~10 := stopRequestedAtCurrentFloor_#t~ret60;havoc stopRequestedAtCurrentFloor_#t~ret60; 92467#L2457-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10);stopRequestedAtCurrentFloor_~retValue_acc~22 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~22; 82385#L2470-1 timeShift_#t~ret75 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret75;havoc timeShift_#t~ret75; 95230#L2605-1 assume !(0 != timeShift_~tmp___9~2); 95159#L2696-3 assume !(1 == ~doorState~0); 83904#L2696-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret50, stopRequestedInDirection_#t~ret51, stopRequestedInDirection_#t~ret52, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~18, stopRequestedInDirection_~tmp~19, stopRequestedInDirection_~tmp___0~7, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~18;havoc stopRequestedInDirection_~tmp~19;havoc stopRequestedInDirection_~tmp___0~7;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret133, isExecutiveFloorCalling_~retValue_acc~25;havoc isExecutiveFloorCalling_~retValue_acc~25;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 83321#L128-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 81508#L155-73 isExecutiveFloorCalling_#t~ret133 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~25 := isExecutiveFloorCalling_#t~ret133;havoc isExecutiveFloorCalling_#t~ret133;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~25; 81509#L3068-4 stopRequestedInDirection_#t~ret50 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~7 := stopRequestedInDirection_#t~ret50;havoc stopRequestedInDirection_#t~ret50; 82604#L2308-2 assume 0 != stopRequestedInDirection_~tmp___0~7;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 83277#L1716-9 stopRequestedInDirection_#t~ret51 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~19 := stopRequestedInDirection_#t~ret51;havoc stopRequestedInDirection_#t~ret51;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~19 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~18 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~18; 83278#L2321-2 timeShift_#t~ret82 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret82;havoc timeShift_#t~ret82; 82131#L2704-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret53, continueInDirection_~dir, continueInDirection_~tmp~20;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~20;~currentHeading~0 := continueInDirection_~dir; 82133#L2365-3 assume !(1 == ~currentHeading~0); 85243#L2375-9 assume !(0 == ~currentFloorID~0); 82466#L2375-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 84240#L2381-11 havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 85048#L1716-11 __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 85352#L893-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 85353#L894-1 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 84044#L1725-5 __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 84045#L898-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 81619#L953-1 cleanup_~i~2 := 1 + cleanup_~i~2; 95189#L1256-2 [2019-01-01 23:21:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1882106937, now seen corresponding path program 3 times [2019-01-01 23:21:29,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:21:29,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:21:29,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:29,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:21:29,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:21:29,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:21:29,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:21:29,269 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:21:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -614225826, now seen corresponding path program 1 times [2019-01-01 23:21:29,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:21:29,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:21:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:29,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:21:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:21:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:21:30,105 WARN L181 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 160 [2019-01-01 23:21:31,037 WARN L181 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 124 [2019-01-01 23:21:31,048 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:21:31,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:21:31,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:21:31,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:21:31,050 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:21:31,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:31,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:21:31,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:21:31,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product31_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-01 23:21:31,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:21:31,051 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:21:31,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,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-01 23:21:31,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,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-01 23:21:31,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,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-01 23:21:31,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,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-01 23:21:31,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,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-01 23:21:31,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:31,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:32,084 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 23:21:32,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:21:32,730 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:32,745 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:32,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:32,769 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:32,769 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret133=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret133=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-01 23:21:32,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:32,800 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:32,825 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:32,825 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___7~2=0} Honda state: {ULTIMATE.start_timeShift_~tmp___7~2=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-01 23:21:32,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:32,879 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-01 23:21:32,892 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:32,892 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret34=0} Honda state: {ULTIMATE.start_isIdle_#t~ret34=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:21:32,925 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:32,925 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:32,934 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:32,934 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,231 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,232 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret51=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret51=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-01 23:21:33,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,274 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,274 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 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-01 23:21:33,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,311 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,311 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~9=0, ULTIMATE.start_isIdle_~retValue_acc~15=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~9=0, ULTIMATE.start_isIdle_~retValue_acc~15=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-01 23:21:33,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,337 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,341 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,341 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___2~5=0} Honda state: {ULTIMATE.start_timeShift_~tmp___2~5=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-01 23:21:33,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,369 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,369 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret4=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret4=0} 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-01 23:21:33,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,393 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,394 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret59=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01 23:21:33,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,420 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,420 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret2=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,444 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,466 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___2~2=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___2~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,505 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,505 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___0~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,531 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,533 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,533 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret78=0} Honda state: {ULTIMATE.start_timeShift_#t~ret78=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,559 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,559 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret76=0} Honda state: {ULTIMATE.start_timeShift_#t~ret76=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,583 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,583 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___3~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_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 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,603 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,606 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,606 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret50=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret50=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:33,642 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:33,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~respectInLiftCalls=1, ULTIMATE.start_stopRequestedInDirection_#in~respectInLiftCalls=1} Honda state: {ULTIMATE.start_stopRequestedInDirection_~respectInLiftCalls=1, ULTIMATE.start_stopRequestedInDirection_#in~respectInLiftCalls=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,662 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:33,662 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:33,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:21:33,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:34,245 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:21:34,247 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:21:34,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:21:34,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:21:34,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:21:34,248 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:21:34,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:34,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:21:34,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:21:34,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product31_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-01 23:21:34,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:21:34,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:21:34,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,892 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 23:21:34,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:34,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,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-01 23:21:35,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,672 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 23:21:35,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:35,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:36,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:21:36,593 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:21:36,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:36,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:36,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:36,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:36,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:36,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:36,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:36,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:36,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:36,716 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:21:36,726 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:21:36,726 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:21:36,734 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:21:36,735 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:21:36,735 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:21:36,735 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~2) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2019-01-01 23:21:36,737 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:21:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:36,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:21:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:37,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:21:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:21:37,237 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:21:37,238 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15343 states and 28668 transitions. cyclomatic complexity: 13327 Second operand 5 states. [2019-01-01 23:21:37,830 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15343 states and 28668 transitions. cyclomatic complexity: 13327. Second operand 5 states. Result 23179 states and 43280 transitions. Complement of second has 8 states. [2019-01-01 23:21:37,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:21:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:21:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6890 transitions. [2019-01-01 23:21:37,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6890 transitions. Stem has 41 letters. Loop has 39 letters. [2019-01-01 23:21:37,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:21:37,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6890 transitions. Stem has 80 letters. Loop has 39 letters. [2019-01-01 23:21:37,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:21:37,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6890 transitions. Stem has 41 letters. Loop has 78 letters. [2019-01-01 23:21:37,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:21:37,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23179 states and 43280 transitions. [2019-01-01 23:21:38,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:21:38,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23179 states to 0 states and 0 transitions. [2019-01-01 23:21:38,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:21:38,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:21:38,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:21:38,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:21:38,009 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:38,009 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:38,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:21:38,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:21:38,009 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-01 23:21:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:21:38,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:21:38,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:21:38,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:21:38,010 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:21:38,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:21:38,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:21:38,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:21:38,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:21:38,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:21:38,010 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:38,011 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:38,011 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:38,011 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:21:38,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:21:38,011 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:21:38,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:21:38,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:21:38 BoogieIcfgContainer [2019-01-01 23:21:38,018 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:21:38,019 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:21:38,019 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:21:38,019 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:21:38,020 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:21:09" (3/4) ... [2019-01-01 23:21:38,023 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:21:38,024 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:21:38,024 INFO L168 Benchmark]: Toolchain (without parser) took 43088.25 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 769.7 MB). Free memory was 948.6 MB in the beginning and 778.3 MB in the end (delta: 170.2 MB). Peak memory consumption was 939.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:38,025 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:21:38,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1112.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:38,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 325.30 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: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:38,027 INFO L168 Benchmark]: Boogie Preprocessor took 288.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:38,028 INFO L168 Benchmark]: RCFGBuilder took 12673.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.0 GB in the beginning and 922.0 MB in the end (delta: 99.9 MB). Peak memory consumption was 406.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:38,029 INFO L168 Benchmark]: BuchiAutomizer took 28678.15 ms. Allocated memory was 1.3 GB in the beginning and 1.8 GB in the end (delta: 462.9 MB). Free memory was 922.0 MB in the beginning and 778.3 MB in the end (delta: 143.6 MB). Peak memory consumption was 606.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:38,030 INFO L168 Benchmark]: Witness Printer took 4.77 ms. Allocated memory is still 1.8 GB. Free memory is still 778.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:21:38,035 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1112.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -141.5 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 325.30 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: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 288.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 12673.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.0 GB in the beginning and 922.0 MB in the end (delta: 99.9 MB). Peak memory consumption was 406.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28678.15 ms. Allocated memory was 1.3 GB in the beginning and 1.8 GB in the end (delta: 462.9 MB). Free memory was 922.0 MB in the beginning and 778.3 MB in the end (delta: 143.6 MB). Peak memory consumption was 606.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.77 ms. Allocated memory is still 1.8 GB. Free memory is still 778.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 8.6s. Construction of modules took 11.8s. Büchi inclusion checks took 5.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 2 MinimizatonAttempts, 41202 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 1.3s Buchi closure took 0.0s. Biggest automaton had 15343 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27032 SDtfs, 130963 SDslu, 80502 SDs, 0 SdLazy, 5720 SolverSat, 1398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax100 hnf100 lsp15 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq221 hnf87 smp100 dnf203 smp87 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 19 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...