./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version aa418289
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer --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 8b0793fae3a16c39df4e1ecce9d338c866ff1e9f
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE
--- Real Ultimate output ---
This is Ultimate 0.1.23-aa41828
[2018-11-23 14:14:50,222 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-23 14:14:50,223 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-23 14:14:50,231 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-23 14:14:50,231 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-23 14:14:50,231 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-23 14:14:50,232 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-23 14:14:50,233 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-23 14:14:50,234 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-23 14:14:50,235 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-23 14:14:50,236 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-23 14:14:50,236 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-23 14:14:50,236 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-23 14:14:50,237 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-23 14:14:50,238 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-23 14:14:50,238 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-23 14:14:50,239 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-23 14:14:50,240 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-23 14:14:50,241 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-23 14:14:50,242 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-23 14:14:50,243 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-23 14:14:50,244 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-23 14:14:50,246 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-23 14:14:50,246 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-23 14:14:50,246 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-23 14:14:50,247 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-23 14:14:50,247 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-23 14:14:50,248 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-23 14:14:50,248 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-23 14:14:50,249 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-23 14:14:50,249 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-23 14:14:50,250 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-23 14:14:50,250 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-23 14:14:50,250 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-23 14:14:50,251 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-23 14:14:50,251 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-23 14:14:50,251 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf
[2018-11-23 14:14:50,262 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-23 14:14:50,262 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-23 14:14:50,263 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-23 14:14:50,263 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-23 14:14:50,264 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-23 14:14:50,264 INFO  L131        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2018-11-23 14:14:50,264 INFO  L133        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2018-11-23 14:14:50,264 INFO  L133        SettingsManager]:  * Use old map elimination=false
[2018-11-23 14:14:50,264 INFO  L133        SettingsManager]:  * Use external solver (rank synthesis)=false
[2018-11-23 14:14:50,264 INFO  L133        SettingsManager]:  * Use only trivial implications for array writes=true
[2018-11-23 14:14:50,264 INFO  L133        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2018-11-23 14:14:50,265 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-23 14:14:50,265 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-23 14:14:50,265 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-11-23 14:14:50,265 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-23 14:14:50,265 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-23 14:14:50,265 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-23 14:14:50,265 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2018-11-23 14:14:50,266 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2018-11-23 14:14:50,266 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2018-11-23 14:14:50,266 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-23 14:14:50,266 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-23 14:14:50,266 INFO  L133        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2018-11-23 14:14:50,266 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-23 14:14:50,266 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2018-11-23 14:14:50,267 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-23 14:14:50,267 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-23 14:14:50,267 INFO  L133        SettingsManager]:  * To the following directory=/home/matthias/ultimate/dump
[2018-11-23 14:14:50,267 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-23 14:14:50,267 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-11-23 14:14:50,267 INFO  L133        SettingsManager]:  * Dump automata to the following directory=/home/matthias/ultimate/dump/auto
[2018-11-23 14:14:50,268 INFO  L131        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-11-23 14:14:50,268 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer
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 -> 8b0793fae3a16c39df4e1ecce9d338c866ff1e9f
[2018-11-23 14:14:50,294 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-23 14:14:50,303 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-23 14:14:50,305 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-23 14:14:50,306 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-23 14:14:50,307 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-23 14:14:50,307 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c
[2018-11-23 14:14:50,350 INFO  L221              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/data/26fa316eb/1310ef17f8914d50af53869636da65c2/FLAG1c7a9a4cd
[2018-11-23 14:14:50,836 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-23 14:14:50,836 INFO  L161              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/sv-benchmarks/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c
[2018-11-23 14:14:50,852 INFO  L355              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/data/26fa316eb/1310ef17f8914d50af53869636da65c2/FLAG1c7a9a4cd
[2018-11-23 14:14:51,329 INFO  L363              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/data/26fa316eb/1310ef17f8914d50af53869636da65c2
[2018-11-23 14:14:51,332 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-23 14:14:51,333 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-23 14:14:51,334 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-23 14:14:51,334 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-23 14:14:51,337 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-23 14:14:51,337 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:51,339 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b51e347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51, skipping insertion in model container
[2018-11-23 14:14:51,339 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:51,345 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-23 14:14:51,395 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-23 14:14:51,810 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 14:14:51,821 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-23 14:14:51,909 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 14:14:51,951 INFO  L195         MainTranslator]: Completed translation
[2018-11-23 14:14:51,951 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51 WrapperNode
[2018-11-23 14:14:51,951 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-23 14:14:51,952 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-23 14:14:51,952 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-23 14:14:51,952 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-23 14:14:51,959 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:51,987 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:52,191 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-23 14:14:52,192 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-23 14:14:52,192 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-23 14:14:52,192 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-23 14:14:52,200 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:52,201 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:52,230 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:52,231 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:52,293 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:52,377 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:52,403 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
[2018-11-23 14:14:52,443 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-23 14:14:52,443 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-23 14:14:52,444 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-23 14:14:52,444 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-23 14:14:52,444 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/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
[2018-11-23 14:14:52,495 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-11-23 14:14:52,495 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2018-11-23 14:14:52,495 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-23 14:14:52,495 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-23 14:14:59,291 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-23 14:14:59,291 INFO  L280             CfgBuilder]: Removed 1553 assue(true) statements.
[2018-11-23 14:14:59,292 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:59 BoogieIcfgContainer
[2018-11-23 14:14:59,292 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-23 14:14:59,292 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2018-11-23 14:14:59,292 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2018-11-23 14:14:59,295 INFO  L276        PluginConnector]: BuchiAutomizer initialized
[2018-11-23 14:14:59,296 INFO  L102         BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2018-11-23 14:14:59,296 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:14:51" (1/3) ...
[2018-11-23 14:14:59,297 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45bdc121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:14:59, skipping insertion in model container
[2018-11-23 14:14:59,297 INFO  L102         BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2018-11-23 14:14:59,297 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:51" (2/3) ...
[2018-11-23 14:14:59,297 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45bdc121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:14:59, skipping insertion in model container
[2018-11-23 14:14:59,297 INFO  L102         BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2018-11-23 14:14:59,297 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:59" (3/3) ...
[2018-11-23 14:14:59,298 INFO  L375   chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product30_false-unreach-call_true-termination.cil.c
[2018-11-23 14:14:59,332 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-11-23 14:14:59,332 INFO  L374         BuchiCegarLoop]: Interprodecural is true
[2018-11-23 14:14:59,332 INFO  L375         BuchiCegarLoop]: Hoare is false
[2018-11-23 14:14:59,332 INFO  L376         BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2018-11-23 14:14:59,333 INFO  L377         BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-23 14:14:59,333 INFO  L378         BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-23 14:14:59,333 INFO  L379         BuchiCegarLoop]: Difference is false
[2018-11-23 14:14:59,333 INFO  L380         BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-23 14:14:59,333 INFO  L383         BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2018-11-23 14:14:59,392 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 6963 states.
[2018-11-23 14:14:59,476 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 3471
[2018-11-23 14:14:59,476 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-23 14:14:59,476 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-23 14:14:59,488 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]
[2018-11-23 14:14:59,488 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]
[2018-11-23 14:14:59,488 INFO  L442         BuchiCegarLoop]: ======== Iteration 1============
[2018-11-23 14:14:59,489 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 6963 states.
[2018-11-23 14:14:59,529 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 3471
[2018-11-23 14:14:59,529 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-23 14:14:59,529 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-23 14:14:59,532 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]
[2018-11-23 14:14:59,533 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]
[2018-11-23 14:14:59,537 INFO  L794   eck$LassoCheckResult]: Stem: 2960#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string18.base, #t~string18.offset := #Ultimate.alloc(30);call #t~string19.base, #t~string19.offset := #Ultimate.alloc(9);call #t~string20.base, #t~string20.offset := #Ultimate.alloc(21);call #t~string21.base, #t~string21.offset := #Ultimate.alloc(30);call #t~string22.base, #t~string22.offset := #Ultimate.alloc(9);call #t~string23.base, #t~string23.offset := #Ultimate.alloc(21);call #t~string27.base, #t~string27.offset := #Ultimate.alloc(30);call #t~string28.base, #t~string28.offset := #Ultimate.alloc(9);call #t~string29.base, #t~string29.offset := #Ultimate.alloc(25);call #t~string30.base, #t~string30.offset := #Ultimate.alloc(30);call #t~string31.base, #t~string31.offset := #Ultimate.alloc(9);call #t~string32.base, #t~string32.offset := #Ultimate.alloc(25);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(10);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string101.base, #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(93, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string103.base, #t~string103.offset, 1);call write~init~int(93, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(32, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(97, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(116, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(32, #t~string105.base, 3 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 4 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string107.base, #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 2 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(10);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string111.base, #t~string111.offset, 1);call write~init~int(112, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 2 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string113.base, #t~string113.offset, 1);call write~init~int(111, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(119, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(110, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 4 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(73, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(76, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(95, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(112, #t~string115.base, 4 + #t~string115.offset, 1);call write~init~int(58, #t~string115.base, 5 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 6 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.alloc(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~string119.base, #t~string119.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.alloc(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~string125.base, #t~string125.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(70, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(95, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(112, #t~string127.base, 3 + #t~string127.offset, 1);call write~init~int(58, #t~string127.base, 4 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 5 + #t~string127.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string144.base, #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 1 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(9);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_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;~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;~head~0.base, ~head~0.offset := 0, 0; 6442#L-1true havoc main_#res;havoc main_#t~ret162, main_~retValue_acc~27, main_~tmp~29;havoc main_~retValue_acc~27;havoc main_~tmp~29; 1159#L430true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 3857#L438true main_#t~ret162 := valid_product_#res;main_~tmp~29 := main_#t~ret162;havoc main_#t~ret162; 3908#L3432true assume 0 != main_~tmp~29; 2024#L3407true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 3336#L472true havoc bigMacCall_#t~ret155, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~6;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~6; 23#L775true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~6 := 4;getOrigin_#res := getOrigin_~retValue_acc~6; 4326#L800true bigMacCall_#t~ret155 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret155;havoc bigMacCall_#t~ret155;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 5508#L2788true assume 0 == initPersonOnFloor_~floor; 5417#L2789true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1254#L2896-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 2756#L2580true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 3207#L2592-2true havoc cleanup_#t~ret156, cleanup_#t~ret157, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;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; 2450#L1112true timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 3322#L2061true assume 0 != timeShift_~tmp~18; 3311#L2062true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4555#L1738-11true havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 1563#L1103-2true __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 3011#L1163-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 5656#L1195-12true __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 4816#L515true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 6662#L525-1true cleanup_~i~3 := 0; 457#L3239-2true 
[2018-11-23 14:14:59,537 INFO  L796   eck$LassoCheckResult]: Loop: 457#L3239-2true assume !false; 356#L3240true cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 159#L3243true assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 1525#L926true cleanup_#t~ret156 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 1235#L3247true assume 1 != cleanup_~tmp___0~10; 1234#L3247-1true havoc isIdle_#res;havoc isIdle_#t~ret53, isIdle_~retValue_acc~15, isIdle_~tmp~10;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~10;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret48, anyStopRequested_#t~ret49, anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 2490#L2517-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 966#L2544-122true anyStopRequested_#t~ret48 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret48;havoc anyStopRequested_#t~ret48; 4575#L1211true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 1602#L1275true isIdle_#t~ret53 := anyStopRequested_#res;isIdle_~tmp~10 := isIdle_#t~ret53;havoc isIdle_#t~ret53;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 2466#L1288true cleanup_#t~ret157 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret157;havoc cleanup_#t~ret157; 3763#L3259true assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;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; 2456#L1112-2true timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 3323#L2061-1true assume 0 != timeShift_~tmp~18; 3312#L2062-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4576#L1738-23true havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 1566#L1103-5true __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 3075#L1163-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 5634#L1195-25true __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 4819#L515-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 6664#L525-3true cleanup_~i~3 := 1 + cleanup_~i~3; 457#L3239-2true 
[2018-11-23 14:14:59,542 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 14:14:59,542 INFO  L82        PathProgramCache]: Analyzing trace with hash -2042449897, now seen corresponding path program 1 times
[2018-11-23 14:14:59,544 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 14:14:59,544 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 14:14:59,585 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:14:59,585 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 14:14:59,585 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:14:59,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 14:14:59,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-23 14:14:59,743 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 14:14:59,744 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-23 14:14:59,747 INFO  L799   eck$LassoCheckResult]: stem already infeasible
[2018-11-23 14:14:59,747 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 14:14:59,747 INFO  L82        PathProgramCache]: Analyzing trace with hash 192516488, now seen corresponding path program 1 times
[2018-11-23 14:14:59,747 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 14:14:59,747 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 14:14:59,748 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:14:59,748 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 14:14:59,748 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:14:59,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 14:14:59,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-23 14:14:59,788 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 14:14:59,788 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-11-23 14:14:59,789 INFO  L811   eck$LassoCheckResult]: loop already infeasible
[2018-11-23 14:14:59,801 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-11-23 14:14:59,802 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-11-23 14:14:59,803 INFO  L87              Difference]: Start difference. First operand 6963 states. Second operand 4 states.
[2018-11-23 14:15:00,656 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 14:15:00,656 INFO  L93              Difference]: Finished difference Result 17141 states and 32445 transitions.
[2018-11-23 14:15:00,657 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-11-23 14:15:00,658 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 17141 states and 32445 transitions.
[2018-11-23 14:15:00,749 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 11959
[2018-11-23 14:15:00,856 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 17141 states to 17099 states and 32396 transitions.
[2018-11-23 14:15:00,857 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 17099
[2018-11-23 14:15:00,877 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 17099
[2018-11-23 14:15:00,878 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17099 states and 32396 transitions.
[2018-11-23 14:15:00,907 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2018-11-23 14:15:00,908 INFO  L705         BuchiCegarLoop]: Abstraction has 17099 states and 32396 transitions.
[2018-11-23 14:15:00,943 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17099 states and 32396 transitions.
[2018-11-23 14:15:01,105 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17099 to 6953.
[2018-11-23 14:15:01,106 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6953 states.
[2018-11-23 14:15:01,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6953 states to 6953 states and 13170 transitions.
[2018-11-23 14:15:01,125 INFO  L728         BuchiCegarLoop]: Abstraction has 6953 states and 13170 transitions.
[2018-11-23 14:15:01,126 INFO  L608         BuchiCegarLoop]: Abstraction has 6953 states and 13170 transitions.
[2018-11-23 14:15:01,126 INFO  L442         BuchiCegarLoop]: ======== Iteration 2============
[2018-11-23 14:15:01,126 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 6953 states and 13170 transitions.
[2018-11-23 14:15:01,159 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 3473
[2018-11-23 14:15:01,159 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-23 14:15:01,160 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-23 14:15:01,163 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]
[2018-11-23 14:15:01,164 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]
[2018-11-23 14:15:01,164 INFO  L794   eck$LassoCheckResult]: Stem: 27870#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string18.base, #t~string18.offset := #Ultimate.alloc(30);call #t~string19.base, #t~string19.offset := #Ultimate.alloc(9);call #t~string20.base, #t~string20.offset := #Ultimate.alloc(21);call #t~string21.base, #t~string21.offset := #Ultimate.alloc(30);call #t~string22.base, #t~string22.offset := #Ultimate.alloc(9);call #t~string23.base, #t~string23.offset := #Ultimate.alloc(21);call #t~string27.base, #t~string27.offset := #Ultimate.alloc(30);call #t~string28.base, #t~string28.offset := #Ultimate.alloc(9);call #t~string29.base, #t~string29.offset := #Ultimate.alloc(25);call #t~string30.base, #t~string30.offset := #Ultimate.alloc(30);call #t~string31.base, #t~string31.offset := #Ultimate.alloc(9);call #t~string32.base, #t~string32.offset := #Ultimate.alloc(25);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(10);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string101.base, #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(93, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string103.base, #t~string103.offset, 1);call write~init~int(93, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(32, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(97, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(116, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(32, #t~string105.base, 3 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 4 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string107.base, #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 2 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(10);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string111.base, #t~string111.offset, 1);call write~init~int(112, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 2 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string113.base, #t~string113.offset, 1);call write~init~int(111, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(119, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(110, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 4 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(73, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(76, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(95, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(112, #t~string115.base, 4 + #t~string115.offset, 1);call write~init~int(58, #t~string115.base, 5 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 6 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.alloc(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~string119.base, #t~string119.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.alloc(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~string125.base, #t~string125.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(70, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(95, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(112, #t~string127.base, 3 + #t~string127.offset, 1);call write~init~int(58, #t~string127.base, 4 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 5 + #t~string127.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string144.base, #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 1 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(9);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_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;~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;~head~0.base, ~head~0.offset := 0, 0; 27871#L-1 havoc main_#res;havoc main_#t~ret162, main_~retValue_acc~27, main_~tmp~29;havoc main_~retValue_acc~27;havoc main_~tmp~29; 25865#L430 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 25866#L438 main_#t~ret162 := valid_product_#res;main_~tmp~29 := main_#t~ret162;havoc main_#t~ret162; 28750#L3432 assume 0 != main_~tmp~29; 26758#L3407 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 26759#L472 havoc bigMacCall_#t~ret155, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~6;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~6; 24166#L775 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~6 := 4;getOrigin_#res := getOrigin_~retValue_acc~6; 24167#L800 bigMacCall_#t~ret155 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret155;havoc bigMacCall_#t~ret155;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 29026#L2788 assume 0 == initPersonOnFloor_~floor; 30019#L2789 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 25237#L2896-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 25969#L2580 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 27564#L2592-2 havoc cleanup_#t~ret156, cleanup_#t~ret157, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;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; 27177#L1112 timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 27178#L2061 assume 0 != timeShift_~tmp~18; 28302#L2062 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 28303#L1738-11 havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 26304#L1103-2 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 26305#L1163-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 27402#L1195-12 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 29584#L515 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~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; 27179#L1112-1 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 27180#L525 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 30329#L525-1 cleanup_~i~3 := 0; 25077#L3239-2 
[2018-11-23 14:15:01,164 INFO  L796   eck$LassoCheckResult]: Loop: 25077#L3239-2 assume !false; 24859#L3240 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 24487#L3243 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 24488#L926 cleanup_#t~ret156 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 25942#L3247 assume 1 != cleanup_~tmp___0~10; 25940#L3247-1 havoc isIdle_#res;havoc isIdle_#t~ret53, isIdle_~retValue_acc~15, isIdle_~tmp~10;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~10;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret48, anyStopRequested_#t~ret49, anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 25941#L2517-122 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 24131#L2544-122 anyStopRequested_#t~ret48 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret48;havoc anyStopRequested_#t~ret48; 25616#L1211 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 26345#L1275 isIdle_#t~ret53 := anyStopRequested_#res;isIdle_~tmp~10 := isIdle_#t~ret53;havoc isIdle_#t~ret53;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 26346#L1288 cleanup_#t~ret157 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret157;havoc cleanup_#t~ret157; 27197#L3259 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;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; 27185#L1112-2 timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 27186#L2061-1 assume 0 != timeShift_~tmp~18; 28305#L2062-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 28306#L1738-23 havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 26308#L1103-5 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 26309#L1163-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 27712#L1195-25 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 29585#L515-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~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; 27189#L1112-3 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 27190#L525-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 30332#L525-3 cleanup_~i~3 := 1 + cleanup_~i~3; 25077#L3239-2 
[2018-11-23 14:15:01,165 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 14:15:01,165 INFO  L82        PathProgramCache]: Analyzing trace with hash 6233140, now seen corresponding path program 1 times
[2018-11-23 14:15:01,165 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 14:15:01,165 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 14:15:01,166 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:15:01,166 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 14:15:01,166 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:15:01,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 14:15:01,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-23 14:15:01,216 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 14:15:01,216 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-23 14:15:01,217 INFO  L799   eck$LassoCheckResult]: stem already infeasible
[2018-11-23 14:15:01,217 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 14:15:01,217 INFO  L82        PathProgramCache]: Analyzing trace with hash 325816645, now seen corresponding path program 1 times
[2018-11-23 14:15:01,217 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 14:15:01,217 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 14:15:01,218 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:15:01,218 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 14:15:01,219 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:15:01,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 14:15:01,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-23 14:15:01,281 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 14:15:01,281 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-11-23 14:15:01,281 INFO  L811   eck$LassoCheckResult]: loop already infeasible
[2018-11-23 14:15:01,281 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-11-23 14:15:01,281 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-11-23 14:15:01,281 INFO  L87              Difference]: Start difference. First operand 6953 states and 13170 transitions. cyclomatic complexity: 6218 Second operand 7 states.
[2018-11-23 14:15:02,082 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 14:15:02,083 INFO  L93              Difference]: Finished difference Result 13201 states and 24891 transitions.
[2018-11-23 14:15:02,083 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2018-11-23 14:15:02,084 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 13201 states and 24891 transitions.
[2018-11-23 14:15:02,146 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 10575
[2018-11-23 14:15:02,199 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 13201 states to 13201 states and 24891 transitions.
[2018-11-23 14:15:02,199 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 13201
[2018-11-23 14:15:02,212 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 13201
[2018-11-23 14:15:02,212 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13201 states and 24891 transitions.
[2018-11-23 14:15:02,228 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2018-11-23 14:15:02,228 INFO  L705         BuchiCegarLoop]: Abstraction has 13201 states and 24891 transitions.
[2018-11-23 14:15:02,241 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13201 states and 24891 transitions.
[2018-11-23 14:15:02,361 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 6936.
[2018-11-23 14:15:02,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6936 states.
[2018-11-23 14:15:02,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 13113 transitions.
[2018-11-23 14:15:02,375 INFO  L728         BuchiCegarLoop]: Abstraction has 6936 states and 13113 transitions.
[2018-11-23 14:15:02,375 INFO  L608         BuchiCegarLoop]: Abstraction has 6936 states and 13113 transitions.
[2018-11-23 14:15:02,375 INFO  L442         BuchiCegarLoop]: ======== Iteration 3============
[2018-11-23 14:15:02,375 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 6936 states and 13113 transitions.
[2018-11-23 14:15:02,399 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 4339
[2018-11-23 14:15:02,400 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2018-11-23 14:15:02,400 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2018-11-23 14:15:02,402 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]
[2018-11-23 14:15:02,402 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]
[2018-11-23 14:15:02,403 INFO  L794   eck$LassoCheckResult]: Stem: 48514#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string18.base, #t~string18.offset := #Ultimate.alloc(30);call #t~string19.base, #t~string19.offset := #Ultimate.alloc(9);call #t~string20.base, #t~string20.offset := #Ultimate.alloc(21);call #t~string21.base, #t~string21.offset := #Ultimate.alloc(30);call #t~string22.base, #t~string22.offset := #Ultimate.alloc(9);call #t~string23.base, #t~string23.offset := #Ultimate.alloc(21);call #t~string27.base, #t~string27.offset := #Ultimate.alloc(30);call #t~string28.base, #t~string28.offset := #Ultimate.alloc(9);call #t~string29.base, #t~string29.offset := #Ultimate.alloc(25);call #t~string30.base, #t~string30.offset := #Ultimate.alloc(30);call #t~string31.base, #t~string31.offset := #Ultimate.alloc(9);call #t~string32.base, #t~string32.offset := #Ultimate.alloc(25);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(10);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string101.base, #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(93, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string103.base, #t~string103.offset, 1);call write~init~int(93, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(32, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(97, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(116, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(32, #t~string105.base, 3 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 4 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string107.base, #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 2 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(10);call #t~string111.base, #t~string111.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string111.base, #t~string111.offset, 1);call write~init~int(112, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 2 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string113.base, #t~string113.offset, 1);call write~init~int(111, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(119, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(110, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 4 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(73, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(76, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(95, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(112, #t~string115.base, 4 + #t~string115.offset, 1);call write~init~int(58, #t~string115.base, 5 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 6 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.alloc(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~string119.base, #t~string119.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.alloc(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~string125.base, #t~string125.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(70, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(95, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(112, #t~string127.base, 3 + #t~string127.offset, 1);call write~init~int(58, #t~string127.base, 4 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 5 + #t~string127.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string144.base, #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 1 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(9);~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_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;~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;~head~0.base, ~head~0.offset := 0, 0; 48515#L-1 havoc main_#res;havoc main_#t~ret162, main_~retValue_acc~27, main_~tmp~29;havoc main_~retValue_acc~27;havoc main_~tmp~29; 46061#L430 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 46062#L438 main_#t~ret162 := valid_product_#res;main_~tmp~29 := main_#t~ret162;havoc main_#t~ret162; 49575#L3432 assume 0 != main_~tmp~29; 47553#L3407 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 47554#L472 havoc bigMacCall_#t~ret155, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~6;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~6; 44372#L775 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~6 := 4;getOrigin_#res := getOrigin_~retValue_acc~6; 44373#L800 bigMacCall_#t~ret155 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret155;havoc bigMacCall_#t~ret155;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 47677#L2788 assume 0 == initPersonOnFloor_~floor; 47406#L2789 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 44380#L2896-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 46178#L2580 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 48168#L2592-2 havoc cleanup_#t~ret156, cleanup_#t~ret157, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;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; 47853#L1112 timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 47854#L2061 assume 0 != timeShift_~tmp~18; 48849#L2062 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 45341#L1738-11 havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 45342#L1103-2 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 46786#L1163-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 47958#L1195-12 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 46256#L515 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~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; 46257#L1112-1 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 47855#L525 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 49571#L526 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 49572#L527 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 50013#L525-1 cleanup_~i~3 := 0; 50011#L3239-2 
[2018-11-23 14:15:02,403 INFO  L796   eck$LassoCheckResult]: Loop: 50011#L3239-2 assume !false; 50010#L3240 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 50009#L3243 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 50008#L926 cleanup_#t~ret156 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 50007#L3247 assume 1 != cleanup_~tmp___0~10; 50006#L3247-1 havoc isIdle_#res;havoc isIdle_#t~ret53, isIdle_~retValue_acc~15, isIdle_~tmp~10;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~10;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret48, anyStopRequested_#t~ret49, anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 50003#L2517-122 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 45768#L2544-122 anyStopRequested_#t~ret48 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret48;havoc anyStopRequested_#t~ret48; 45472#L1211 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 44513#L1275 isIdle_#t~ret53 := anyStopRequested_#res;isIdle_~tmp~10 := isIdle_#t~ret53;havoc isIdle_#t~ret53;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 49966#L1288 cleanup_#t~ret157 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret157;havoc cleanup_#t~ret157; 49515#L3259 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;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; 47860#L1112-2 timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 47861#L2061-1 assume 0 != timeShift_~tmp~18; 48853#L2062-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 45521#L1738-23 havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~3;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 45522#L1103-5 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 46798#L1163-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 47944#L1195-25 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 46264#L515-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~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; 46265#L1112-3 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 47864#L525-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 49573#L526-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 49574#L527-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 50012#L525-3 cleanup_~i~3 := 1 + cleanup_~i~3; 50011#L3239-2 
[2018-11-23 14:15:02,403 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 14:15:02,403 INFO  L82        PathProgramCache]: Analyzing trace with hash 1693707535, now seen corresponding path program 1 times
[2018-11-23 14:15:02,403 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 14:15:02,403 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 14:15:02,404 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:15:02,404 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 14:15:02,404 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:15:02,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 14:15:02,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-23 14:15:02,451 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 14:15:02,452 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-11-23 14:15:02,452 INFO  L799   eck$LassoCheckResult]: stem already infeasible
[2018-11-23 14:15:02,452 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 14:15:02,452 INFO  L82        PathProgramCache]: Analyzing trace with hash -423653952, now seen corresponding path program 1 times
[2018-11-23 14:15:02,452 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 14:15:02,452 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 14:15:02,453 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:15:02,453 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 14:15:02,453 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 14:15:02,457 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 14:15:02,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 14:15:02,638 WARN  L180               SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92
[2018-11-23 14:15:02,851 WARN  L180               SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86
[2018-11-23 14:15:02,859 INFO  L216          LassoAnalysis]: Preferences:
[2018-11-23 14:15:02,860 INFO  L124   ssoRankerPreferences]: Compute integeral hull: false
[2018-11-23 14:15:02,860 INFO  L125   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2018-11-23 14:15:02,860 INFO  L126   ssoRankerPreferences]: Term annotations enabled: false
[2018-11-23 14:15:02,860 INFO  L127   ssoRankerPreferences]: Use exernal solver: true
[2018-11-23 14:15:02,860 INFO  L128   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2018-11-23 14:15:02,860 INFO  L129   ssoRankerPreferences]: Dump SMT script to file: false
[2018-11-23 14:15:02,860 INFO  L130   ssoRankerPreferences]: Path of dumped script: 
[2018-11-23 14:15:02,860 INFO  L131   ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product30_false-unreach-call_true-termination.cil.c_Iteration3_Loop
[2018-11-23 14:15:02,861 INFO  L132   ssoRankerPreferences]: MapElimAlgo: Frank
[2018-11-23 14:15:02,861 INFO  L282          LassoAnalysis]: Starting lasso preprocessing...
[2018-11-23 14:15:02,876 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,879 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,892 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,898 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,906 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,908 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,912 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,914 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,918 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,925 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,926 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,934 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,936 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,937 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,940 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,941 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,942 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,943 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,944 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,949 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,950 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,951 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,952 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,953 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,956 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,960 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,961 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:02,962 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:03,214 INFO  L300          LassoAnalysis]: Preprocessing complete.
[2018-11-23 14:15:03,215 INFO  L412          LassoAnalysis]: Checking for nontermination...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/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
[2018-11-23 14:15:03,218 INFO  L151   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2018-11-23 14:15:03,219 INFO  L163   nArgumentSynthesizer]: Using integer mode.
[2018-11-23 14:15:03,223 INFO  L445          LassoAnalysis]: Proved nontermination for one component.
[2018-11-23 14:15:03,223 INFO  L448          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret157=0} Honda state: {ULTIMATE.start_cleanup_#t~ret157=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/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
[2018-11-23 14:15:03,239 INFO  L151   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2018-11-23 14:15:03,239 INFO  L163   nArgumentSynthesizer]: Using integer mode.
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e14299ca-c0b2-4df3-bd3f-72b43bc5f9b1/bin-2019/uautomizer/z3
Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2018-11-23 14:15:03,259 INFO  L151   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2018-11-23 14:15:03,259 INFO  L163   nArgumentSynthesizer]: Using integer mode.
[2018-11-23 14:15:15,307 INFO  L450          LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'.
[2018-11-23 14:15:15,309 INFO  L216          LassoAnalysis]: Preferences:
[2018-11-23 14:15:15,309 INFO  L124   ssoRankerPreferences]: Compute integeral hull: false
[2018-11-23 14:15:15,310 INFO  L125   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2018-11-23 14:15:15,310 INFO  L126   ssoRankerPreferences]: Term annotations enabled: false
[2018-11-23 14:15:15,310 INFO  L127   ssoRankerPreferences]: Use exernal solver: false
[2018-11-23 14:15:15,310 INFO  L128   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2018-11-23 14:15:15,310 INFO  L129   ssoRankerPreferences]: Dump SMT script to file: false
[2018-11-23 14:15:15,310 INFO  L130   ssoRankerPreferences]: Path of dumped script: 
[2018-11-23 14:15:15,310 INFO  L131   ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product30_false-unreach-call_true-termination.cil.c_Iteration3_Loop
[2018-11-23 14:15:15,310 INFO  L132   ssoRankerPreferences]: MapElimAlgo: Frank
[2018-11-23 14:15:15,310 INFO  L282          LassoAnalysis]: Starting lasso preprocessing...
[2018-11-23 14:15:15,312 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,328 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,333 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,335 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,336 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,338 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,342 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,355 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,367 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,368 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,374 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,375 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,383 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,385 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,400 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,403 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,405 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,406 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,413 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,415 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,423 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,425 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,426 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,427 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,438 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,455 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,457 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,461 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2018-11-23 14:15:15,736 INFO  L300          LassoAnalysis]: Preprocessing complete.
[2018-11-23 14:15:15,740 INFO  L497          LassoAnalysis]: Using template 'affine'.
[2018-11-23 14:15:15,741 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
[2018-11-23 14:15:15,742 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,742 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,743 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,743 INFO  L206   nArgumentSynthesizer]: 1 loop disjuncts
[2018-11-23 14:15:15,743 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,745 INFO  L402   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2018-11-23 14:15:15,745 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,748 INFO  L530          LassoAnalysis]: Proving termination failed for this template and these settings.
[2018-11-23 14:15:15,748 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
[2018-11-23 14:15:15,749 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,749 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,749 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,749 INFO  L206   nArgumentSynthesizer]: 1 loop disjuncts
[2018-11-23 14:15:15,749 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,750 INFO  L402   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2018-11-23 14:15:15,750 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,751 INFO  L530          LassoAnalysis]: Proving termination failed for this template and these settings.
[2018-11-23 14:15:15,751 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
[2018-11-23 14:15:15,752 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,752 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,752 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,752 INFO  L206   nArgumentSynthesizer]: 1 loop disjuncts
[2018-11-23 14:15:15,752 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,752 INFO  L402   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2018-11-23 14:15:15,752 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,753 INFO  L530          LassoAnalysis]: Proving termination failed for this template and these settings.
[2018-11-23 14:15:15,753 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
[2018-11-23 14:15:15,753 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,753 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,754 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,754 INFO  L206   nArgumentSynthesizer]: 1 loop disjuncts
[2018-11-23 14:15:15,754 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,754 INFO  L402   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2018-11-23 14:15:15,754 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,759 INFO  L530          LassoAnalysis]: Proving termination failed for this template and these settings.
[2018-11-23 14:15:15,759 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
[2018-11-23 14:15:15,760 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,760 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,760 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,760 INFO  L206   nArgumentSynthesizer]: 1 loop disjuncts
[2018-11-23 14:15:15,760 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,760 INFO  L402   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2018-11-23 14:15:15,760 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,762 INFO  L530          LassoAnalysis]: Proving termination failed for this template and these settings.
[2018-11-23 14:15:15,762 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
[2018-11-23 14:15:15,763 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,763 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,764 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,764 INFO  L206   nArgumentSynthesizer]: 1 loop disjuncts
[2018-11-23 14:15:15,764 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,764 INFO  L402   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2018-11-23 14:15:15,764 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,765 INFO  L530          LassoAnalysis]: Proving termination failed for this template and these settings.
[2018-11-23 14:15:15,766 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
[2018-11-23 14:15:15,766 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,766 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,768 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,768 INFO  L206   nArgumentSynthesizer]: 2 loop disjuncts
[2018-11-23 14:15:15,768 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,769 INFO  L402   nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications.
[2018-11-23 14:15:15,769 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,774 INFO  L530          LassoAnalysis]: Proving termination failed for this template and these settings.
[2018-11-23 14:15:15,778 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
[2018-11-23 14:15:15,779 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,779 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,779 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,779 INFO  L206   nArgumentSynthesizer]: 1 loop disjuncts
[2018-11-23 14:15:15,779 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,780 INFO  L402   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2018-11-23 14:15:15,780 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,782 INFO  L530          LassoAnalysis]: Proving termination failed for this template and these settings.
[2018-11-23 14:15:15,782 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
[2018-11-23 14:15:15,786 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,786 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,786 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,786 INFO  L206   nArgumentSynthesizer]: 1 loop disjuncts
[2018-11-23 14:15:15,786 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,787 INFO  L402   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2018-11-23 14:15:15,787 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,787 INFO  L530          LassoAnalysis]: Proving termination failed for this template and these settings.
[2018-11-23 14:15:15,788 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
[2018-11-23 14:15:15,788 INFO  L339   nArgumentSynthesizer]: Template has degree 0.
[2018-11-23 14:15:15,788 INFO  L352   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2018-11-23 14:15:15,788 INFO  L205   nArgumentSynthesizer]: 1 stem disjuncts
[2018-11-23 14:15:15,788 INFO  L206   nArgumentSynthesizer]: 1 loop disjuncts
[2018-11-23 14:15:15,788 INFO  L207   nArgumentSynthesizer]: 2 template conjuncts.
[2018-11-23 14:15:15,789 INFO  L402   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2018-11-23 14:15:15,789 INFO  L403   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2018-11-23 14:15:15,792 INFO  L421   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2018-11-23 14:15:15,796 INFO  L443   ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2018-11-23 14:15:15,796 INFO  L444   ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero.
[2018-11-23 14:15:15,798 INFO  L437   nArgumentSynthesizer]: Simplifying supporting invariants...
[2018-11-23 14:15:15,798 INFO  L440   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2018-11-23 14:15:15,798 INFO  L518          LassoAnalysis]: Proved termination.
[2018-11-23 14:15:15,798 INFO  L520          LassoAnalysis]: Termination argument consisting of:
Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~3) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~3
Supporting invariants []
[2018-11-23 14:15:15,799 INFO  L297   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2018-11-23 14:15:15,833 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 14:15:15,897 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 14:15:15,902 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-11-23 14:15:15,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 14:15:15,926 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-11-23 14:15:15,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-23 14:15:15,953 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 
[2018-11-23 14:15:15,953 INFO  L72    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6936 states and 13113 transitions. cyclomatic complexity: 6178 Second operand 5 states.
[2018-11-23 14:15:16,410 INFO  L76    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6936 states and 13113 transitions. cyclomatic complexity: 6178. Second operand 5 states. Result 11275 states and 21317 transitions. Complement of second has 8 states.
[2018-11-23 14:15:16,411 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 
[2018-11-23 14:15:16,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2018-11-23 14:15:16,418 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9943 transitions.
[2018-11-23 14:15:16,419 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 9943 transitions. Stem has 27 letters. Loop has 25 letters.
[2018-11-23 14:15:16,420 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2018-11-23 14:15:16,420 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 9943 transitions. Stem has 52 letters. Loop has 25 letters.
[2018-11-23 14:15:16,421 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2018-11-23 14:15:16,421 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 9943 transitions. Stem has 27 letters. Loop has 50 letters.
[2018-11-23 14:15:16,421 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2018-11-23 14:15:16,422 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 11275 states and 21317 transitions.
[2018-11-23 14:15:16,460 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2018-11-23 14:15:16,460 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 11275 states to 0 states and 0 transitions.
[2018-11-23 14:15:16,460 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2018-11-23 14:15:16,460 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2018-11-23 14:15:16,460 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2018-11-23 14:15:16,460 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2018-11-23 14:15:16,461 INFO  L705         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-11-23 14:15:16,461 INFO  L728         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-11-23 14:15:16,461 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-11-23 14:15:16,461 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-11-23 14:15:16,461 INFO  L87              Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states.
[2018-11-23 14:15:16,461 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 14:15:16,461 INFO  L93              Difference]: Finished difference Result 0 states and 0 transitions.
[2018-11-23 14:15:16,461 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2018-11-23 14:15:16,461 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions.
[2018-11-23 14:15:16,462 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2018-11-23 14:15:16,462 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions.
[2018-11-23 14:15:16,462 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2018-11-23 14:15:16,462 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2018-11-23 14:15:16,462 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2018-11-23 14:15:16,462 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2018-11-23 14:15:16,462 INFO  L705         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-11-23 14:15:16,462 INFO  L728         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-11-23 14:15:16,462 INFO  L608         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-11-23 14:15:16,462 INFO  L442         BuchiCegarLoop]: ======== Iteration 4============
[2018-11-23 14:15:16,462 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2018-11-23 14:15:16,462 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2018-11-23 14:15:16,462 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2018-11-23 14:15:16,468 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:15:16 BoogieIcfgContainer
[2018-11-23 14:15:16,468 INFO  L132        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2018-11-23 14:15:16,468 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-23 14:15:16,468 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-23 14:15:16,468 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-23 14:15:16,469 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:59" (3/4) ...
[2018-11-23 14:15:16,472 INFO  L147         WitnessPrinter]: No result that supports witness generation found
[2018-11-23 14:15:16,472 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-23 14:15:16,472 INFO  L168              Benchmark]: Toolchain (without parser) took 25139.86 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 917.0 MB). Free memory was 957.5 MB in the beginning and 1.6 GB in the end (delta: -656.2 MB). Peak memory consumption was 260.7 MB. Max. memory is 11.5 GB.
[2018-11-23 14:15:16,473 INFO  L168              Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-23 14:15:16,473 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 617.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB.
[2018-11-23 14:15:16,474 INFO  L168              Benchmark]: Boogie Procedure Inliner took 239.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 11.5 GB.
[2018-11-23 14:15:16,474 INFO  L168              Benchmark]: Boogie Preprocessor took 251.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 69.7 MB). Peak memory consumption was 69.7 MB. Max. memory is 11.5 GB.
[2018-11-23 14:15:16,474 INFO  L168              Benchmark]: RCFGBuilder took 6848.37 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 454.0 MB). Free memory was 999.7 MB in the beginning and 1.3 GB in the end (delta: -253.4 MB). Peak memory consumption was 433.3 MB. Max. memory is 11.5 GB.
[2018-11-23 14:15:16,475 INFO  L168              Benchmark]: BuchiAutomizer took 17175.73 ms. Allocated memory was 1.7 GB in the beginning and 1.9 GB in the end (delta: 286.8 MB). Free memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: -360.7 MB). There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-23 14:15:16,475 INFO  L168              Benchmark]: Witness Printer took 3.57 ms. Allocated memory is still 1.9 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-23 14:15:16,480 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 617.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB.
 * Boogie Procedure Inliner took 239.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 73.0 MB). Peak memory consumption was 73.0 MB. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 251.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 69.7 MB). Peak memory consumption was 69.7 MB. Max. memory is 11.5 GB.
 * RCFGBuilder took 6848.37 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 454.0 MB). Free memory was 999.7 MB in the beginning and 1.3 GB in the end (delta: -253.4 MB). Peak memory consumption was 433.3 MB. Max. memory is 11.5 GB.
 * BuchiAutomizer took 17175.73 ms. Allocated memory was 1.7 GB in the beginning and 1.9 GB in the end (delta: 286.8 MB). Free memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: -360.7 MB). There was no memory consumed. Max. memory is 11.5 GB.
 * Witness Printer took 3.57 ms. Allocated memory is still 1.9 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 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 17.1s and 4 iterations.  TraceHistogramMax:1. Analysis of lassos took 13.7s. Construction of modules took 0.5s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 16411 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 6953 states and ocurred in iteration 1.	Nontrivial modules had stage [1, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 45325 SDtfs, 87174 SDslu, 102543 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time	LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks:   Lassos: inital121 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 1	LassoNonterminationAnalysisTime: 12.0s	
  - TerminationAnalysisResult: Termination proven
    Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
Received shutdown request...