./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/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.24-cad4683 [2019-11-15 21:21:15,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:21:15,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:21:15,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:21:15,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:21:15,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:21:15,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:21:15,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:21:15,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:21:15,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:21:15,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:21:15,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:21:15,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:21:15,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:21:15,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:21:15,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:21:15,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:21:15,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:21:15,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:21:15,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:21:15,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:21:15,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:21:15,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:21:15,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:21:15,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:21:15,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:21:15,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:21:15,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:21:15,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:21:15,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:21:15,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:21:15,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:21:15,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:21:15,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:21:15,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:21:15,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:21:15,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:21:15,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:21:15,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:21:15,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:21:15,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:21:15,425 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:21:15,456 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:21:15,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:21:15,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:21:15,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:21:15,458 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:21:15,458 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:21:15,459 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:21:15,459 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:21:15,459 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:21:15,459 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:21:15,459 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:21:15,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:21:15,460 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:21:15,460 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:21:15,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:21:15,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:21:15,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:21:15,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:21:15,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:21:15,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:21:15,462 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:21:15,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:21:15,462 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:21:15,463 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:21:15,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:21:15,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:21:15,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:21:15,464 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:21:15,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:21:15,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:21:15,464 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:21:15,479 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:21:15,480 INFO L138 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/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/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 [2019-11-15 21:21:15,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:21:15,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:21:15,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:21:15,542 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:21:15,543 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:21:15,543 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2019-11-15 21:21:15,611 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/data/acde0e007/9dba0f3469eb414788f0be9195d2e4ae/FLAG5c2e31a5e [2019-11-15 21:21:16,309 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:21:16,313 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2019-11-15 21:21:16,344 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/data/acde0e007/9dba0f3469eb414788f0be9195d2e4ae/FLAG5c2e31a5e [2019-11-15 21:21:16,517 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/data/acde0e007/9dba0f3469eb414788f0be9195d2e4ae [2019-11-15 21:21:16,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:21:16,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:21:16,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:16,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:21:16,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:21:16,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:16" (1/1) ... [2019-11-15 21:21:16,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756d6f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:16, skipping insertion in model container [2019-11-15 21:21:16,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:16" (1/1) ... [2019-11-15 21:21:16,550 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:21:16,644 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:21:17,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:17,329 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:21:17,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:17,515 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:21:17,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17 WrapperNode [2019-11-15 21:21:17,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:17,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:21:17,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:21:17,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:21:17,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... [2019-11-15 21:21:17,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... [2019-11-15 21:21:17,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:21:17,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:21:17,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:21:17,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:21:17,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... [2019-11-15 21:21:17,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... [2019-11-15 21:21:17,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... [2019-11-15 21:21:17,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... [2019-11-15 21:21:18,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... [2019-11-15 21:21:18,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... [2019-11-15 21:21:18,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... [2019-11-15 21:21:18,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:21:18,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:21:18,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:21:18,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:21:18,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/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 [2019-11-15 21:21:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:21:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 21:21:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:21:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:21:32,434 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:21:32,435 INFO L284 CfgBuilder]: Removed 1697 assume(true) statements. [2019-11-15 21:21:32,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:32 BoogieIcfgContainer [2019-11-15 21:21:32,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:21:32,441 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:21:32,441 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:21:32,444 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:21:32,445 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:21:32,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:21:16" (1/3) ... [2019-11-15 21:21:32,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3595d9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:21:32, skipping insertion in model container [2019-11-15 21:21:32,446 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:21:32,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:17" (2/3) ... [2019-11-15 21:21:32,447 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3595d9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:21:32, skipping insertion in model container [2019-11-15 21:21:32,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:21:32,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:32" (3/3) ... [2019-11-15 21:21:32,450 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2019-11-15 21:21:32,500 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:21:32,500 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:21:32,501 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:21:32,501 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:21:32,501 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:21:32,501 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:21:32,501 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:21:32,502 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:21:32,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2019-11-15 21:21:32,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2019-11-15 21:21:32,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:21:32,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:21:32,810 INFO L849 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] [2019-11-15 21:21:32,810 INFO L850 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] [2019-11-15 21:21:32,811 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:21:32,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2019-11-15 21:21:32,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2019-11-15 21:21:32,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:21:32,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:21:32,912 INFO L849 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] [2019-11-15 21:21:32,912 INFO L850 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] [2019-11-15 21:21:32,920 INFO L791 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.allocOnStack(10);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(10);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(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.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(21);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(30);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(9);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(25);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(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 [2019-11-15 21:21:32,921 INFO L793 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 [2019-11-15 21:21:32,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1851464233, now seen corresponding path program 1 times [2019-11-15 21:21:32,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:32,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363410676] [2019-11-15 21:21:32,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:32,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:32,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:33,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363410676] [2019-11-15 21:21:33,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:33,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:21:33,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704891340] [2019-11-15 21:21:33,288 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:21:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1010745214, now seen corresponding path program 1 times [2019-11-15 21:21:33,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:33,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309078047] [2019-11-15 21:21:33,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:33,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:33,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:33,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309078047] [2019-11-15 21:21:33,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:33,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:21:33,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252945142] [2019-11-15 21:21:33,360 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:21:33,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:21:33,381 INFO L87 Difference]: Start difference. First operand 7183 states. Second operand 4 states. [2019-11-15 21:21:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:34,556 INFO L93 Difference]: Finished difference Result 17581 states and 33181 transitions. [2019-11-15 21:21:34,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:21:34,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17581 states and 33181 transitions. [2019-11-15 21:21:34,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12289 [2019-11-15 21:21:34,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17581 states to 17539 states and 33132 transitions. [2019-11-15 21:21:34,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17539 [2019-11-15 21:21:34,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17539 [2019-11-15 21:21:34,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17539 states and 33132 transitions. [2019-11-15 21:21:35,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:21:35,032 INFO L688 BuchiCegarLoop]: Abstraction has 17539 states and 33132 transitions. [2019-11-15 21:21:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17539 states and 33132 transitions. [2019-11-15 21:21:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17539 to 7173. [2019-11-15 21:21:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7173 states. [2019-11-15 21:21:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 13538 transitions. [2019-11-15 21:21:35,423 INFO L711 BuchiCegarLoop]: Abstraction has 7173 states and 13538 transitions. [2019-11-15 21:21:35,424 INFO L591 BuchiCegarLoop]: Abstraction has 7173 states and 13538 transitions. [2019-11-15 21:21:35,424 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:21:35,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7173 states and 13538 transitions. [2019-11-15 21:21:35,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3583 [2019-11-15 21:21:35,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:21:35,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:21:35,490 INFO L849 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] [2019-11-15 21:21:35,490 INFO L850 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] [2019-11-15 21:21:35,491 INFO L791 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.allocOnStack(10);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(10);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(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.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(21);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(30);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(9);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(25);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(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 [2019-11-15 21:21:35,492 INFO L793 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 [2019-11-15 21:21:35,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1140123340, now seen corresponding path program 1 times [2019-11-15 21:21:35,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:35,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432929140] [2019-11-15 21:21:35,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:35,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:35,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:35,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432929140] [2019-11-15 21:21:35,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:35,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:21:35,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722962212] [2019-11-15 21:21:35,657 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:21:35,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:35,657 INFO L82 PathProgramCache]: Analyzing trace with hash -662448065, now seen corresponding path program 1 times [2019-11-15 21:21:35,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:35,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495970905] [2019-11-15 21:21:35,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:35,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:35,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:35,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495970905] [2019-11-15 21:21:35,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:35,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:21:35,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148484120] [2019-11-15 21:21:35,732 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:21:35,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:21:35,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:21:35,733 INFO L87 Difference]: Start difference. First operand 7173 states and 13538 transitions. cyclomatic complexity: 6366 Second operand 7 states. [2019-11-15 21:21:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:37,116 INFO L93 Difference]: Finished difference Result 13576 states and 25511 transitions. [2019-11-15 21:21:37,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:21:37,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13576 states and 25511 transitions. [2019-11-15 21:21:37,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10875 [2019-11-15 21:21:37,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13576 states to 13576 states and 25511 transitions. [2019-11-15 21:21:37,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13576 [2019-11-15 21:21:37,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13576 [2019-11-15 21:21:37,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13576 states and 25511 transitions. [2019-11-15 21:21:37,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:21:37,318 INFO L688 BuchiCegarLoop]: Abstraction has 13576 states and 25511 transitions. [2019-11-15 21:21:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13576 states and 25511 transitions. [2019-11-15 21:21:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13576 to 7141. [2019-11-15 21:21:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7141 states. [2019-11-15 21:21:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 13453 transitions. [2019-11-15 21:21:37,540 INFO L711 BuchiCegarLoop]: Abstraction has 7141 states and 13453 transitions. [2019-11-15 21:21:37,540 INFO L591 BuchiCegarLoop]: Abstraction has 7141 states and 13453 transitions. [2019-11-15 21:21:37,540 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:21:37,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7141 states and 13453 transitions. [2019-11-15 21:21:37,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4469 [2019-11-15 21:21:37,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:21:37,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:21:37,583 INFO L849 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] [2019-11-15 21:21:37,583 INFO L850 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] [2019-11-15 21:21:37,584 INFO L791 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.allocOnStack(10);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(10);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(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.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(21);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(30);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(9);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(25);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(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 [2019-11-15 21:21:37,584 INFO L793 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 [2019-11-15 21:21:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash -443227825, now seen corresponding path program 1 times [2019-11-15 21:21:37,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:37,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719298489] [2019-11-15 21:21:37,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:37,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:37,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:37,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719298489] [2019-11-15 21:21:37,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:37,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:21:37,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173864742] [2019-11-15 21:21:37,683 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:21:37,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash -958239558, now seen corresponding path program 1 times [2019-11-15 21:21:37,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:37,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66704142] [2019-11-15 21:21:37,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:37,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:37,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:37,765 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:38,121 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-15 21:21:38,268 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-15 21:21:38,279 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:21:38,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:21:38,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:21:38,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:21:38,281 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:21:38,281 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:21:38,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:21:38,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:21:38,282 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product32.cil.c_Iteration3_Loop [2019-11-15 21:21:38,282 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:21:38,282 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:21:38,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:38,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,035 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:21:39,042 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:21:39,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,059 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:21:39,068 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,069 INFO L440 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/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:21:39,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:21:39,091 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,091 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~persons_0~0=1} Honda state: {~persons_0~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:21:39,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,119 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:21:39,126 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,126 INFO L440 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/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/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 [2019-11-15 21:21:39,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:21:39,230 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,230 INFO L440 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/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:21:39,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,312 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:21:39,319 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,319 INFO L440 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/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:21:39,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,339 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:21:39,347 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,347 INFO L440 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/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:21:39,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:21:39,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:21:39,370 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,370 INFO L440 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/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/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 [2019-11-15 21:21:39,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:21:39,386 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,386 INFO L440 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/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/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 [2019-11-15 21:21:39,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:21:39,408 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,409 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=4, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=4, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~0=4, ~doorState~0=4, ULTIMATE.start_timeShift_~tmp~15=4} Honda state: {ULTIMATE.start_areDoorsOpen_#res=4, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=4, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~0=4, ~doorState~0=4, ULTIMATE.start_timeShift_~tmp~15=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:21:39,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,436 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:21:39,440 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:21:39,441 INFO L440 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/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/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 [2019-11-15 21:21:39,458 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:21:39,460 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bbc0c03-b085-4e99-8a6a-a1b173246ee4/bin/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 [2019-11-15 21:21:39,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:21:39,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:21:39,483 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:21:39,485 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:21:39,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:21:39,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:21:39,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:21:39,485 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:21:39,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:21:39,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:21:39,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:21:39,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product32.cil.c_Iteration3_Loop [2019-11-15 21:21:39,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:21:39,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:21:39,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:39,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:21:40,261 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:21:40,273 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:21:40,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,280 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,280 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,286 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,289 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,289 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,293 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,298 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,305 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,305 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,306 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,312 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,313 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,313 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:21:40,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,315 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:21:40,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,328 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,337 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,338 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,338 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,338 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,345 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,347 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,350 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:21:40,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,352 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:21:40,352 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,372 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,373 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,376 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:21:40,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,378 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:21:40,379 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,384 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,387 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,390 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,391 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,391 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,395 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,397 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,398 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,401 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,407 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,410 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,414 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,419 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,420 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,422 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,423 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,423 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:21:40,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:21:40,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:21:40,426 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:21:40,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:21:40,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:21:40,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:21:40,428 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:21:40,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:21:40,432 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:21:40,438 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:21:40,438 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:21:40,440 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:21:40,440 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:21:40,441 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:21:40,442 INFO L512 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 [] [2019-11-15 21:21:40,443 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:21:40,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:40,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:21:40,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:40,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:21:40,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:40,748 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:21:40,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7141 states and 13453 transitions. cyclomatic complexity: 6313 Second operand 5 states. [2019-11-15 21:21:41,576 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. [2019-11-15 21:21:41,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:21:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:21:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10219 transitions. [2019-11-15 21:21:41,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10219 transitions. Stem has 27 letters. Loop has 25 letters. [2019-11-15 21:21:41,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:41,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10219 transitions. Stem has 52 letters. Loop has 25 letters. [2019-11-15 21:21:41,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:41,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10219 transitions. Stem has 27 letters. Loop has 50 letters. [2019-11-15 21:21:41,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:21:41,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11610 states and 21873 transitions. [2019-11-15 21:21:41,656 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:21:41,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11610 states to 0 states and 0 transitions. [2019-11-15 21:21:41,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:21:41,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:21:41,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:21:41,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:21:41,657 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:21:41,657 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:21:41,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:41,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:21:41,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:21:41,658 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-15 21:21:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:41,659 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 21:21:41,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:21:41,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 21:21:41,659 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:21:41,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:21:41,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:21:41,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:21:41,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:21:41,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:21:41,660 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:21:41,660 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:21:41,661 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:21:41,661 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:21:41,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:21:41,661 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:21:41,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:21:41,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:21:41 BoogieIcfgContainer [2019-11-15 21:21:41,668 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:21:41,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:21:41,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:21:41,669 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:21:41,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:32" (3/4) ... [2019-11-15 21:21:41,673 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:21:41,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:21:41,675 INFO L168 Benchmark]: Toolchain (without parser) took 25152.76 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 938.0 MB in the beginning and 1.8 GB in the end (delta: -854.6 MB). Peak memory consumption was 307.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:41,675 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:41,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 989.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -110.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:41,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 407.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 972.5 MB in the end (delta: 76.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:41,677 INFO L168 Benchmark]: Boogie Preprocessor took 515.61 ms. Allocated memory is still 1.1 GB. Free memory was 972.5 MB in the beginning and 903.3 MB in the end (delta: 69.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:41,678 INFO L168 Benchmark]: RCFGBuilder took 14000.06 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 554.7 MB). Free memory was 903.3 MB in the beginning and 1.2 GB in the end (delta: -303.8 MB). Peak memory consumption was 434.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:41,679 INFO L168 Benchmark]: BuchiAutomizer took 9227.64 ms. Allocated memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: 499.1 MB). Free memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: -585.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:41,679 INFO L168 Benchmark]: Witness Printer took 4.59 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:41,683 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 989.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -110.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 407.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 972.5 MB in the end (delta: 76.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 515.61 ms. Allocated memory is still 1.1 GB. Free memory was 972.5 MB in the beginning and 903.3 MB in the end (delta: 69.2 MB). Peak memory consumption was 69.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 14000.06 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 554.7 MB). Free memory was 903.3 MB in the beginning and 1.2 GB in the end (delta: -303.8 MB). Peak memory consumption was 434.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9227.64 ms. Allocated memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: 499.1 MB). Free memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: -585.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.59 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 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 9.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.8s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 2 MinimizatonAttempts, 16801 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.6s 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.8s 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: 16ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...