./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product32_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product32_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/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 ad37f41f9928d4c807c216cb8990b98ca950475b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 18:12:59,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 18:12:59,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 18:12:59,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 18:12:59,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 18:12:59,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 18:12:59,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 18:12:59,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 18:12:59,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 18:12:59,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 18:12:59,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 18:12:59,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 18:12:59,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 18:12:59,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 18:12:59,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 18:12:59,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 18:12:59,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 18:12:59,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 18:12:59,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 18:12:59,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 18:12:59,127 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 18:12:59,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 18:12:59,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 18:12:59,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 18:12:59,129 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 18:12:59,129 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 18:12:59,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 18:12:59,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 18:12:59,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 18:12:59,131 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 18:12:59,131 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 18:12:59,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 18:12:59,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 18:12:59,132 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 18:12:59,132 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 18:12:59,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 18:12:59,133 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 18:12:59,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 18:12:59,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 18:12:59,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 18:12:59,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 18:12:59,142 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 18:12:59,142 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 18:12:59,142 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 18:12:59,142 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 18:12:59,142 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 18:12:59,142 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 18:12:59,142 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 18:12:59,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 18:12:59,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 18:12:59,142 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 18:12:59,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 18:12:59,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 18:12:59,144 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 18:12:59,144 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 18:12:59,144 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 18:12:59,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 18:12:59,144 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 18:12:59,144 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 18:12:59,144 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 18:12:59,145 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_c254a85f-a0dc-4ccd-8369-23f6894a2069/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 -> ad37f41f9928d4c807c216cb8990b98ca950475b [2018-12-01 18:12:59,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 18:12:59,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 18:12:59,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 18:12:59,175 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 18:12:59,175 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 18:12:59,176 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec9_product32_false-unreach-call_true-termination.cil.c [2018-12-01 18:12:59,211 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/data/63fcce86c/f68cab07137c4ca69a5b6152cfefcb55/FLAG1e41495de [2018-12-01 18:12:59,675 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 18:12:59,675 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/sv-benchmarks/c/product-lines/elevator_spec9_product32_false-unreach-call_true-termination.cil.c [2018-12-01 18:12:59,685 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/data/63fcce86c/f68cab07137c4ca69a5b6152cfefcb55/FLAG1e41495de [2018-12-01 18:12:59,693 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/data/63fcce86c/f68cab07137c4ca69a5b6152cfefcb55 [2018-12-01 18:12:59,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 18:12:59,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 18:12:59,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 18:12:59,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 18:12:59,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 18:12:59,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:12:59" (1/1) ... [2018-12-01 18:12:59,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f103c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:12:59, skipping insertion in model container [2018-12-01 18:12:59,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:12:59" (1/1) ... [2018-12-01 18:12:59,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 18:12:59,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 18:13:00,083 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:13:00,094 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 18:13:00,176 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:13:00,215 INFO L195 MainTranslator]: Completed translation [2018-12-01 18:13:00,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00 WrapperNode [2018-12-01 18:13:00,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 18:13:00,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 18:13:00,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 18:13:00,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 18:13:00,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... [2018-12-01 18:13:00,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... [2018-12-01 18:13:00,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 18:13:00,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 18:13:00,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 18:13:00,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 18:13:00,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... [2018-12-01 18:13:00,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... [2018-12-01 18:13:00,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... [2018-12-01 18:13:00,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... [2018-12-01 18:13:00,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... [2018-12-01 18:13:00,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... [2018-12-01 18:13:00,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... [2018-12-01 18:13:00,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 18:13:00,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 18:13:00,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 18:13:00,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 18:13:00,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/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-12-01 18:13:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 18:13:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-01 18:13:00,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 18:13:00,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 18:13:06,131 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 18:13:06,131 INFO L280 CfgBuilder]: Removed 1697 assue(true) statements. [2018-12-01 18:13:06,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:13:06 BoogieIcfgContainer [2018-12-01 18:13:06,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 18:13:06,132 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 18:13:06,132 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 18:13:06,135 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 18:13:06,136 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:13:06,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 06:12:59" (1/3) ... [2018-12-01 18:13:06,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@214ca0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:13:06, skipping insertion in model container [2018-12-01 18:13:06,137 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:13:06,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:13:00" (2/3) ... [2018-12-01 18:13:06,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@214ca0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:13:06, skipping insertion in model container [2018-12-01 18:13:06,138 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:13:06,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:13:06" (3/3) ... [2018-12-01 18:13:06,139 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product32_false-unreach-call_true-termination.cil.c [2018-12-01 18:13:06,171 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 18:13:06,172 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 18:13:06,172 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 18:13:06,172 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 18:13:06,172 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 18:13:06,172 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 18:13:06,172 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 18:13:06,172 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 18:13:06,172 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 18:13:06,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2018-12-01 18:13:06,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2018-12-01 18:13:06,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:13:06,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:13:06,327 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-12-01 18:13:06,327 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-12-01 18:13:06,327 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 18:13:06,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2018-12-01 18:13:06,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2018-12-01 18:13:06,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:13:06,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:13:06,361 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-12-01 18:13:06,361 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-12-01 18:13:06,365 INFO L794 eck$LassoCheckResult]: Stem: 1898#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~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;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.alloc(10);call #t~string66.base, #t~string66.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string66.base, #t~string66.offset, 1);call write~init~int(95, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(93, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string68.base, #t~string68.offset, 1);call write~init~int(93, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 3 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string70.base, #t~string70.offset, 1);call write~init~int(97, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(32, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string72.base, #t~string72.offset, 1);call write~init~int(105, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.alloc(10);call #t~string76.base, #t~string76.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string76.base, #t~string76.offset, 1);call write~init~int(112, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 2 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string78.base, #t~string78.offset, 1);call write~init~int(111, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(119, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(110, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string80.base, #t~string80.offset, 1);call write~init~int(73, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(76, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(95, #t~string80.base, 3 + #t~string80.offset, 1);call write~init~int(112, #t~string80.base, 4 + #t~string80.offset, 1);call write~init~int(58, #t~string80.base, 5 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 6 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string82.base, #t~string82.offset, 1);call write~init~int(37, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(105, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string88.base, #t~string88.offset, 1);call write~init~int(37, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(105, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(70, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(95, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(112, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(58, #t~string92.base, 4 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 5 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string109.base, #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 1 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string133.base, #t~string133.offset := #Ultimate.alloc(30);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(9);call #t~string135.base, #t~string135.offset := #Ultimate.alloc(21);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(30);call #t~string137.base, #t~string137.offset := #Ultimate.alloc(9);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(21);call #t~string142.base, #t~string142.offset := #Ultimate.alloc(30);call #t~string143.base, #t~string143.offset := #Ultimate.alloc(9);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(25);call #t~string145.base, #t~string145.offset := #Ultimate.alloc(30);call #t~string146.base, #t~string146.offset := #Ultimate.alloc(9);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(25);~cleanupTimeShifts~0 := 12; 6698#L-1true havoc main_#res;havoc main_#t~ret164, main_~retValue_acc~28, main_~tmp~29;havoc main_~retValue_acc~28;havoc main_~tmp~29; 4289#L2956true havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 5361#L2964true main_#t~ret164 := valid_product_#res;main_~tmp~29 := main_#t~ret164;havoc main_#t~ret164; 4181#L3307true assume 0 != main_~tmp~29; 1780#L3282true ~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; 1045#L751true havoc bigMacCall_#t~ret157, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 6969#L3364true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 1074#L3389true bigMacCall_#t~ret157 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret157;havoc bigMacCall_#t~ret157;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; 1044#L399true assume 0 == initPersonOnFloor_~floor; 901#L400true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 3118#L507-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 6961#L191true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5945#L203-2true havoc cleanup_#t~ret158, cleanup_#t~ret159, cleanup_~i~1, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~1;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 2683#L1161true timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 1494#L2171true assume 0 != timeShift_~tmp~15; 1455#L2172true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1447#L1817-11true havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __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~0;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 2744#L1152-10true __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 3062#L1212-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 7109#L1244-12true __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 2443#L794true 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; 2738#L804-1true cleanup_~i~1 := 0; 2194#L3114-2true [2018-12-01 18:13:06,366 INFO L796 eck$LassoCheckResult]: Loop: 2194#L3114-2true assume !false; 2175#L3115true cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 2146#L3118true assume cleanup_~i~1 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 2753#L975true cleanup_#t~ret158 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret158;havoc cleanup_#t~ret158; 4869#L3122true assume 1 != cleanup_~tmp___0~10; 4877#L3122-1true havoc isIdle_#res;havoc isIdle_#t~ret11, isIdle_~retValue_acc~10, isIdle_~tmp~5;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 4749#L128-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 2949#L155-130true anyStopRequested_#t~ret6 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret6;havoc anyStopRequested_#t~ret6; 5950#L1260true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 2482#L1324true isIdle_#t~ret11 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret11;havoc isIdle_#t~ret11;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 2689#L1337true cleanup_#t~ret159 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret159;havoc cleanup_#t~ret159; 5663#L3134true assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 2686#L1161-2true timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 1496#L2171-1true assume 0 != timeShift_~tmp~15; 1456#L2172-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1422#L1817-23true havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __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~0;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 2757#L1152-21true __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 2991#L1212-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 7056#L1244-25true __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 2430#L794-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; 2740#L804-3true cleanup_~i~1 := 1 + cleanup_~i~1; 2194#L3114-2true [2018-12-01 18:13:06,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:13:06,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1851464233, now seen corresponding path program 1 times [2018-12-01 18:13:06,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:13:06,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:13:06,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:06,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:13:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:13:06,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:13:06,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:13:06,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 18:13:06,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:13:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1010745214, now seen corresponding path program 1 times [2018-12-01 18:13:06,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:13:06,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:13:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:06,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:13:06,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:13:06,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:13:06,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:13:06,540 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:13:06,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:13:06,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:13:06,551 INFO L87 Difference]: Start difference. First operand 7183 states. Second operand 4 states. [2018-12-01 18:13:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:13:07,118 INFO L93 Difference]: Finished difference Result 17581 states and 33181 transitions. [2018-12-01 18:13:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 18:13:07,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17581 states and 33181 transitions. [2018-12-01 18:13:07,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12289 [2018-12-01 18:13:07,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17581 states to 17539 states and 33132 transitions. [2018-12-01 18:13:07,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17539 [2018-12-01 18:13:07,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17539 [2018-12-01 18:13:07,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17539 states and 33132 transitions. [2018-12-01 18:13:07,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:13:07,289 INFO L705 BuchiCegarLoop]: Abstraction has 17539 states and 33132 transitions. [2018-12-01 18:13:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17539 states and 33132 transitions. [2018-12-01 18:13:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17539 to 7173. [2018-12-01 18:13:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7173 states. [2018-12-01 18:13:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 13538 transitions. [2018-12-01 18:13:07,444 INFO L728 BuchiCegarLoop]: Abstraction has 7173 states and 13538 transitions. [2018-12-01 18:13:07,444 INFO L608 BuchiCegarLoop]: Abstraction has 7173 states and 13538 transitions. [2018-12-01 18:13:07,444 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 18:13:07,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7173 states and 13538 transitions. [2018-12-01 18:13:07,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3583 [2018-12-01 18:13:07,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:13:07,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:13:07,477 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-12-01 18:13:07,477 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-12-01 18:13:07,478 INFO L794 eck$LassoCheckResult]: Stem: 27198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~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;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.alloc(10);call #t~string66.base, #t~string66.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string66.base, #t~string66.offset, 1);call write~init~int(95, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(93, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string68.base, #t~string68.offset, 1);call write~init~int(93, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 3 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string70.base, #t~string70.offset, 1);call write~init~int(97, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(32, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string72.base, #t~string72.offset, 1);call write~init~int(105, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.alloc(10);call #t~string76.base, #t~string76.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string76.base, #t~string76.offset, 1);call write~init~int(112, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 2 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string78.base, #t~string78.offset, 1);call write~init~int(111, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(119, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(110, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string80.base, #t~string80.offset, 1);call write~init~int(73, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(76, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(95, #t~string80.base, 3 + #t~string80.offset, 1);call write~init~int(112, #t~string80.base, 4 + #t~string80.offset, 1);call write~init~int(58, #t~string80.base, 5 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 6 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string82.base, #t~string82.offset, 1);call write~init~int(37, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(105, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string88.base, #t~string88.offset, 1);call write~init~int(37, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(105, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(70, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(95, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(112, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(58, #t~string92.base, 4 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 5 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string109.base, #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 1 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string133.base, #t~string133.offset := #Ultimate.alloc(30);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(9);call #t~string135.base, #t~string135.offset := #Ultimate.alloc(21);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(30);call #t~string137.base, #t~string137.offset := #Ultimate.alloc(9);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(21);call #t~string142.base, #t~string142.offset := #Ultimate.alloc(30);call #t~string143.base, #t~string143.offset := #Ultimate.alloc(9);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(25);call #t~string145.base, #t~string145.offset := #Ultimate.alloc(30);call #t~string146.base, #t~string146.offset := #Ultimate.alloc(9);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(25);~cleanupTimeShifts~0 := 12; 27199#L-1 havoc main_#res;havoc main_#t~ret164, main_~retValue_acc~28, main_~tmp~29;havoc main_~retValue_acc~28;havoc main_~tmp~29; 30055#L2956 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 30056#L2964 main_#t~ret164 := valid_product_#res;main_~tmp~29 := main_#t~ret164;havoc main_#t~ret164; 29863#L3307 assume 0 != main_~tmp~29; 27049#L3282 ~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; 26371#L751 havoc bigMacCall_#t~ret157, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 26372#L3364 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 26395#L3389 bigMacCall_#t~ret157 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret157;havoc bigMacCall_#t~ret157;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; 26370#L399 assume 0 == initPersonOnFloor_~floor; 26137#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 25488#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 28630#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 31198#L203-2 havoc cleanup_#t~ret158, cleanup_#t~ret159, cleanup_~i~1, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~1;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 27938#L1161 timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 26781#L2171 assume 0 != timeShift_~tmp~15; 26739#L2172 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 24987#L1817-11 havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __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~0;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 26731#L1152-10 __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 27977#L1212-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 28253#L1244-12 __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 27782#L794 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 27783#L1161-1 __utac_acc__Specification9_spec__3_#t~ret2 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret2;havoc __utac_acc__Specification9_spec__3_#t~ret2; 27939#L804 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 27225#L804-1 cleanup_~i~1 := 0; 27616#L3114-2 [2018-12-01 18:13:07,478 INFO L796 eck$LassoCheckResult]: Loop: 27616#L3114-2 assume !false; 27600#L3115 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 27569#L3118 assume cleanup_~i~1 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 27570#L975 cleanup_#t~ret158 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret158;havoc cleanup_#t~ret158; 27988#L3122 assume 1 != cleanup_~tmp___0~10; 30549#L3122-1 havoc isIdle_#res;havoc isIdle_#t~ret11, isIdle_~retValue_acc~10, isIdle_~tmp~5;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 30508#L128-130 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 28404#L155-130 anyStopRequested_#t~ret6 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret6;havoc anyStopRequested_#t~ret6; 28405#L1260 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 24855#L1324 isIdle_#t~ret11 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret11;havoc isIdle_#t~ret11;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 27819#L1337 cleanup_#t~ret159 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret159;havoc cleanup_#t~ret159; 27942#L3134 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 27940#L1161-2 timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 26784#L2171-1 assume 0 != timeShift_~tmp~15; 26741#L2172-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 24996#L1817-23 havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __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~0;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 26706#L1152-21 __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 27993#L1212-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 28208#L1244-25 __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 27768#L794-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 27769#L1161-3 __utac_acc__Specification9_spec__3_#t~ret2 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret2;havoc __utac_acc__Specification9_spec__3_#t~ret2; 27941#L804-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 27231#L804-3 cleanup_~i~1 := 1 + cleanup_~i~1; 27616#L3114-2 [2018-12-01 18:13:07,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:13:07,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1140123340, now seen corresponding path program 1 times [2018-12-01 18:13:07,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:13:07,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:13:07,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:07,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:13:07,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:13:07,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:13:07,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:13:07,531 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 18:13:07,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:13:07,532 INFO L82 PathProgramCache]: Analyzing trace with hash -662448065, now seen corresponding path program 1 times [2018-12-01 18:13:07,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:13:07,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:13:07,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:07,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:13:07,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:13:07,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:13:07,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 18:13:07,599 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:13:07,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 18:13:07,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 18:13:07,599 INFO L87 Difference]: Start difference. First operand 7173 states and 13538 transitions. cyclomatic complexity: 6366 Second operand 7 states. [2018-12-01 18:13:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:13:08,148 INFO L93 Difference]: Finished difference Result 13576 states and 25511 transitions. [2018-12-01 18:13:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 18:13:08,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13576 states and 25511 transitions. [2018-12-01 18:13:08,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10875 [2018-12-01 18:13:08,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13576 states to 13576 states and 25511 transitions. [2018-12-01 18:13:08,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13576 [2018-12-01 18:13:08,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13576 [2018-12-01 18:13:08,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13576 states and 25511 transitions. [2018-12-01 18:13:08,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:13:08,267 INFO L705 BuchiCegarLoop]: Abstraction has 13576 states and 25511 transitions. [2018-12-01 18:13:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13576 states and 25511 transitions. [2018-12-01 18:13:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13576 to 7141. [2018-12-01 18:13:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7141 states. [2018-12-01 18:13:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 13453 transitions. [2018-12-01 18:13:08,359 INFO L728 BuchiCegarLoop]: Abstraction has 7141 states and 13453 transitions. [2018-12-01 18:13:08,359 INFO L608 BuchiCegarLoop]: Abstraction has 7141 states and 13453 transitions. [2018-12-01 18:13:08,359 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 18:13:08,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7141 states and 13453 transitions. [2018-12-01 18:13:08,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4469 [2018-12-01 18:13:08,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:13:08,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:13:08,375 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-12-01 18:13:08,375 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-12-01 18:13:08,375 INFO L794 eck$LassoCheckResult]: Stem: 50321#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~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;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.alloc(10);call #t~string66.base, #t~string66.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string66.base, #t~string66.offset, 1);call write~init~int(95, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(93, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string68.base, #t~string68.offset, 1);call write~init~int(93, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 3 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string70.base, #t~string70.offset, 1);call write~init~int(97, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(32, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string72.base, #t~string72.offset, 1);call write~init~int(105, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.alloc(10);call #t~string76.base, #t~string76.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string76.base, #t~string76.offset, 1);call write~init~int(112, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 2 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string78.base, #t~string78.offset, 1);call write~init~int(111, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(119, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(110, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string80.base, #t~string80.offset, 1);call write~init~int(73, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(76, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(95, #t~string80.base, 3 + #t~string80.offset, 1);call write~init~int(112, #t~string80.base, 4 + #t~string80.offset, 1);call write~init~int(58, #t~string80.base, 5 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 6 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string82.base, #t~string82.offset, 1);call write~init~int(37, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(105, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string88.base, #t~string88.offset, 1);call write~init~int(37, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(105, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(70, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(95, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(112, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(58, #t~string92.base, 4 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 5 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string109.base, #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 1 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string133.base, #t~string133.offset := #Ultimate.alloc(30);call #t~string134.base, #t~string134.offset := #Ultimate.alloc(9);call #t~string135.base, #t~string135.offset := #Ultimate.alloc(21);call #t~string136.base, #t~string136.offset := #Ultimate.alloc(30);call #t~string137.base, #t~string137.offset := #Ultimate.alloc(9);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(21);call #t~string142.base, #t~string142.offset := #Ultimate.alloc(30);call #t~string143.base, #t~string143.offset := #Ultimate.alloc(9);call #t~string144.base, #t~string144.offset := #Ultimate.alloc(25);call #t~string145.base, #t~string145.offset := #Ultimate.alloc(30);call #t~string146.base, #t~string146.offset := #Ultimate.alloc(9);call #t~string147.base, #t~string147.offset := #Ultimate.alloc(25);~cleanupTimeShifts~0 := 12; 50322#L-1 havoc main_#res;havoc main_#t~ret164, main_~retValue_acc~28, main_~tmp~29;havoc main_~retValue_acc~28;havoc main_~tmp~29; 48426#L2956 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 48427#L2964 main_#t~ret164 := valid_product_#res;main_~tmp~29 := main_#t~ret164;havoc main_#t~ret164; 48173#L3307 assume 0 != main_~tmp~29; 48174#L3282 ~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; 48863#L751 havoc bigMacCall_#t~ret157, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 48864#L3364 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 48953#L3389 bigMacCall_#t~ret157 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret157;havoc bigMacCall_#t~ret157;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; 48838#L399 assume 0 == initPersonOnFloor_~floor; 48194#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 45579#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 46237#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 50068#L203-2 havoc cleanup_#t~ret158, cleanup_#t~ret159, cleanup_~i~1, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~1;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 50069#L1161 timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 49681#L2171 assume 0 != timeShift_~tmp~15; 49582#L2172 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 46279#L1817-11 havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __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~0;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 49539#L1152-10 __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 46114#L1212-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 45784#L1244-12 __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 51015#L794 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 51016#L1161-1 __utac_acc__Specification9_spec__3_#t~ret2 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret2;havoc __utac_acc__Specification9_spec__3_#t~ret2; 51221#L804 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 51260#L805 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 51261#L806 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 48679#L804-1 cleanup_~i~1 := 0; 50714#L3114-2 [2018-12-01 18:13:08,375 INFO L796 eck$LassoCheckResult]: Loop: 50714#L3114-2 assume !false; 50686#L3115 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 50665#L3118 assume cleanup_~i~1 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 50666#L975 cleanup_#t~ret158 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret158;havoc cleanup_#t~ret158; 49145#L3122 assume 1 != cleanup_~tmp___0~10; 49146#L3122-1 havoc isIdle_#res;havoc isIdle_#t~ret11, isIdle_~retValue_acc~10, isIdle_~tmp~5;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 48987#L128-130 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 45913#L155-130 anyStopRequested_#t~ret6 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret6;havoc anyStopRequested_#t~ret6; 45914#L1260 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 51298#L1324 isIdle_#t~ret11 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret11;havoc isIdle_#t~ret11;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 51297#L1337 cleanup_#t~ret159 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret159;havoc cleanup_#t~ret159; 51296#L3134 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 51295#L1161-2 timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 49684#L2171-1 assume 0 != timeShift_~tmp~15; 49583#L2172-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 46250#L1817-23 havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __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~0;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 49508#L1152-21 __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 45994#L1212-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 45714#L1244-25 __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 51268#L794-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 51980#L1161-3 __utac_acc__Specification9_spec__3_#t~ret2 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret2;havoc __utac_acc__Specification9_spec__3_#t~ret2; 51282#L804-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 51283#L805-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 51272#L806-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 48621#L804-3 cleanup_~i~1 := 1 + cleanup_~i~1; 50714#L3114-2 [2018-12-01 18:13:08,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:13:08,375 INFO L82 PathProgramCache]: Analyzing trace with hash -443227825, now seen corresponding path program 1 times [2018-12-01 18:13:08,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:13:08,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:13:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:13:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:13:08,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:13:08,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:13:08,399 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 18:13:08,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:13:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash -958239558, now seen corresponding path program 1 times [2018-12-01 18:13:08,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:13:08,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:13:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:13:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:13:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:13:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:13:08,557 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2018-12-01 18:13:08,617 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:13:08,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:13:08,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:13:08,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:13:08,618 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 18:13:08,618 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:08,618 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:13:08,618 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:13:08,618 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product32_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-12-01 18:13:08,618 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:13:08,618 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:13:08,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:08,914 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:13:08,914 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/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-12-01 18:13:08,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:08,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:08,923 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:08,923 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret158=0} Honda state: {ULTIMATE.start_cleanup_#t~ret158=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/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-12-01 18:13:08,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:08,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:08,951 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:08,951 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~persons_0~0=1} Honda state: {~persons_0~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/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-12-01 18:13:08,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:08,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:08,977 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:08,977 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret159=0} Honda state: {ULTIMATE.start_cleanup_#t~ret159=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:09,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:09,004 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:09,004 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0, ULTIMATE.start_cleanup_~tmp~27=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0, ULTIMATE.start_cleanup_~tmp~27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:09,021 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:09,026 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:09,026 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:09,042 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:09,045 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:09,045 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~5=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:09,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:09,065 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:09,065 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Honda state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:09,082 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:09,097 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:09,098 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:09,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:09,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:09,107 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=-8, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~0=-8, ~doorState~0=-8, ULTIMATE.start_timeShift_~tmp~15=-8} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=-8, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~0=-8, ~doorState~0=-8, ULTIMATE.start_timeShift_~tmp~15=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:09,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:09,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:13:09,128 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret11=0} Honda state: {ULTIMATE.start_isIdle_#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:13:09,144 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c254a85f-a0dc-4ccd-8369-23f6894a2069/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 18:13:09,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:13:09,182 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 18:13:09,183 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:13:09,183 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:13:09,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:13:09,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:13:09,183 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:13:09,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:13:09,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:13:09,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:13:09,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product32_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2018-12-01 18:13:09,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:13:09,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:13:09,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:13:09,464 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:13:09,468 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:13:09,470 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-12-01 18:13:09,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,476 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-12-01 18:13:09,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,480 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-12-01 18:13:09,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,483 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-12-01 18:13:09,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,485 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-12-01 18:13:09,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,486 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:13:09,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,487 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:13:09,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,493 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-12-01 18:13:09,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,496 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-12-01 18:13:09,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,498 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-12-01 18:13:09,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,500 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-12-01 18:13:09,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,502 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-12-01 18:13:09,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,503 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:13:09,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:13:09,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,509 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-12-01 18:13:09,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,513 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-12-01 18:13:09,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,515 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-12-01 18:13:09,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,516 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:13:09,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,517 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:13:09,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,519 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-12-01 18:13:09,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,521 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-12-01 18:13:09,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,523 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-12-01 18:13:09,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,525 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-12-01 18:13:09,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,527 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-12-01 18:13:09,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,529 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-12-01 18:13:09,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,531 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-12-01 18:13:09,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,534 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-12-01 18:13:09,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,535 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-12-01 18:13:09,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:13:09,537 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-12-01 18:13:09,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:13:09,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:13:09,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:13:09,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:13:09,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:13:09,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:13:09,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:13:09,539 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:13:09,541 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 18:13:09,541 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 18:13:09,543 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:13:09,543 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 18:13:09,543 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:13:09,543 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2018-12-01 18:13:09,544 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-01 18:13:09,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:13:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:09,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:13:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:13:09,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:13:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:13:09,679 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-12-01 18:13:09,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7141 states and 13453 transitions. cyclomatic complexity: 6313 Second operand 5 states. [2018-12-01 18:13:10,001 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7141 states and 13453 transitions. cyclomatic complexity: 6313. Second operand 5 states. Result 11610 states and 21873 transitions. Complement of second has 8 states. [2018-12-01 18:13:10,001 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-12-01 18:13:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 18:13:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10219 transitions. [2018-12-01 18:13:10,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10219 transitions. Stem has 27 letters. Loop has 25 letters. [2018-12-01 18:13:10,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:13:10,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10219 transitions. Stem has 52 letters. Loop has 25 letters. [2018-12-01 18:13:10,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:13:10,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10219 transitions. Stem has 27 letters. Loop has 50 letters. [2018-12-01 18:13:10,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:13:10,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11610 states and 21873 transitions. [2018-12-01 18:13:10,043 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 18:13:10,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11610 states to 0 states and 0 transitions. [2018-12-01 18:13:10,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 18:13:10,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 18:13:10,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 18:13:10,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:13:10,043 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:13:10,043 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:13:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:13:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:13:10,044 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-01 18:13:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:13:10,044 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-01 18:13:10,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 18:13:10,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-01 18:13:10,044 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 18:13:10,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 18:13:10,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 18:13:10,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 18:13:10,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 18:13:10,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:13:10,044 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:13:10,044 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:13:10,044 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:13:10,044 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 18:13:10,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 18:13:10,044 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 18:13:10,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 18:13:10,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 06:13:10 BoogieIcfgContainer [2018-12-01 18:13:10,049 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 18:13:10,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 18:13:10,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 18:13:10,049 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 18:13:10,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:13:06" (3/4) ... [2018-12-01 18:13:10,052 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 18:13:10,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 18:13:10,052 INFO L168 Benchmark]: Toolchain (without parser) took 10356.64 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 901.8 MB). Free memory was 956.0 MB in the beginning and 1.6 GB in the end (delta: -623.4 MB). Peak memory consumption was 278.3 MB. Max. memory is 11.5 GB. [2018-12-01 18:13:10,053 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:13:10,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 519.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -115.0 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2018-12-01 18:13:10,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 169.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. [2018-12-01 18:13:10,054 INFO L168 Benchmark]: Boogie Preprocessor took 190.08 ms. Allocated memory is still 1.1 GB. Free memory was 997.4 MB in the beginning and 921.4 MB in the end (delta: 76.0 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. [2018-12-01 18:13:10,054 INFO L168 Benchmark]: RCFGBuilder took 5556.14 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 443.0 MB). Free memory was 921.4 MB in the beginning and 1.2 GB in the end (delta: -320.4 MB). Peak memory consumption was 419.7 MB. Max. memory is 11.5 GB. [2018-12-01 18:13:10,054 INFO L168 Benchmark]: BuchiAutomizer took 3916.31 ms. Allocated memory was 1.6 GB in the beginning and 1.9 GB in the end (delta: 340.3 MB). Free memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: -337.7 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. [2018-12-01 18:13:10,054 INFO L168 Benchmark]: Witness Printer took 3.02 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-12-01 18:13:10,056 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 519.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -115.0 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 169.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 73.6 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 190.08 ms. Allocated memory is still 1.1 GB. Free memory was 997.4 MB in the beginning and 921.4 MB in the end (delta: 76.0 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5556.14 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 443.0 MB). Free memory was 921.4 MB in the beginning and 1.2 GB in the end (delta: -320.4 MB). Peak memory consumption was 419.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3916.31 ms. Allocated memory was 1.6 GB in the beginning and 1.9 GB in the end (delta: 340.3 MB). Free memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: -337.7 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.02 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 3.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.3s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 16801 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 7173 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 46465 SDtfs, 89722 SDslu, 104771 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 6ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...