./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e7c9485412041f5ced738777edbcc586e5ce326d6f265b136a50fe41e5db19fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:36:03,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:36:03,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:36:03,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:36:03,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:36:03,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:36:03,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:36:03,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:36:03,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:36:03,720 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:36:03,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:36:03,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:36:03,721 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:36:03,721 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:36:03,721 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:36:03,722 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:36:03,722 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:36:03,722 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:36:03,722 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:36:03,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:36:03,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:36:03,722 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:36:03,723 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:36:03,724 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:36:03,724 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:36:03,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:36:03,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:36:03,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:36:03,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:36:03,725 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:36:03,725 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> e7c9485412041f5ced738777edbcc586e5ce326d6f265b136a50fe41e5db19fb [2025-01-10 07:36:03,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:36:03,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:36:03,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:36:03,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:36:03,964 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:36:03,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c [2025-01-10 07:36:05,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d46f758a/42a6309d1f564342accc69d562d9d30e/FLAGcf9f80cf4 [2025-01-10 07:36:05,554 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:36:05,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c [2025-01-10 07:36:05,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d46f758a/42a6309d1f564342accc69d562d9d30e/FLAGcf9f80cf4 [2025-01-10 07:36:05,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d46f758a/42a6309d1f564342accc69d562d9d30e [2025-01-10 07:36:05,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:36:05,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:36:05,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:36:05,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:36:05,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:36:05,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:36:05" (1/1) ... [2025-01-10 07:36:05,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be0c882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:05, skipping insertion in model container [2025-01-10 07:36:05,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:36:05" (1/1) ... [2025-01-10 07:36:05,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:36:06,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:36:06,023 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:36:06,030 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-01-10 07:36:06,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [57] [2025-01-10 07:36:06,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification13_spec.i","") [160] [2025-01-10 07:36:06,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [251] [2025-01-10 07:36:06,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [604] [2025-01-10 07:36:06,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1271] [2025-01-10 07:36:06,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1391] [2025-01-10 07:36:06,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1426] [2025-01-10 07:36:06,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1792] [2025-01-10 07:36:06,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3453] [2025-01-10 07:36:06,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:36:06,139 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:36:06,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06 WrapperNode [2025-01-10 07:36:06,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:36:06,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:36:06,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:36:06,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:36:06,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:06,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:06,857 INFO L138 Inliner]: procedures = 97, calls = 355, calls flagged for inlining = 207, calls inlined = 2065, statements flattened = 69690 [2025-01-10 07:36:06,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:36:06,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:36:06,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:36:06,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:36:06,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:06,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,199 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-01-10 07:36:07,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:36:07,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:36:07,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:36:07,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:36:07,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (1/1) ... [2025-01-10 07:36:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:07,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:08,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:08,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:36:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:36:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:36:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:36:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:36:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 07:36:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 07:36:08,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-10 07:36:08,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-10 07:36:08,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:36:08,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:36:08,192 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:36:08,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:36:29,796 INFO L? ?]: Removed 30382 outVars from TransFormulas that were not future-live. [2025-01-10 07:36:29,797 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:36:30,128 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:36:30,128 INFO L312 CfgBuilder]: Removed 61 assume(true) statements. [2025-01-10 07:36:30,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:36:30 BoogieIcfgContainer [2025-01-10 07:36:30,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:36:30,135 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:36:30,135 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:36:30,141 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:36:30,142 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:36:30,142 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:36:05" (1/3) ... [2025-01-10 07:36:30,143 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4687f590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:36:30, skipping insertion in model container [2025-01-10 07:36:30,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:36:30,143 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:36:06" (2/3) ... [2025-01-10 07:36:30,143 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4687f590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:36:30, skipping insertion in model container [2025-01-10 07:36:30,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:36:30,143 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:36:30" (3/3) ... [2025-01-10 07:36:30,144 INFO L363 chiAutomizerObserver]: Analyzing ICFG elevator_spec13_product32.cil.c [2025-01-10 07:36:30,328 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:36:30,332 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:36:30,332 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:36:30,332 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:36:30,333 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:36:30,333 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:36:30,333 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:36:30,333 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:36:30,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18431 states, 18430 states have (on average 1.8737384698860553) internal successors, (34533), 18430 states have internal predecessors, (34533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:30,697 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:30,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:30,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:30,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:30,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:30,706 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:36:30,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18431 states, 18430 states have (on average 1.8737384698860553) internal successors, (34533), 18430 states have internal predecessors, (34533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:31,107 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:31,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:31,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:31,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:31,110 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:31,115 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0;" [2025-01-10 07:36:31,119 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i~3#1 < 5;" "assume !(0 == existInLiftCallsInDirection_~i~3#1);" "assume !(1 == existInLiftCallsInDirection_~i~3#1);" "assume !(2 == existInLiftCallsInDirection_~i~3#1);" "assume !(3 == existInLiftCallsInDirection_~i~3#1);" "assume !(4 == existInLiftCallsInDirection_~i~3#1);" "existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1;" [2025-01-10 07:36:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1516016117, now seen corresponding path program 1 times [2025-01-10 07:36:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:31,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548663264] [2025-01-10 07:36:31,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:31,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:31,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:36:31,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:36:31,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:31,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548663264] [2025-01-10 07:36:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548663264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:31,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:31,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:36:31,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445940055] [2025-01-10 07:36:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:31,553 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:31,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:31,554 INFO L85 PathProgramCache]: Analyzing trace with hash -265661025, now seen corresponding path program 1 times [2025-01-10 07:36:31,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:31,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087425311] [2025-01-10 07:36:31,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:31,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:31,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:31,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:31,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:31,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:31,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:31,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:31,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:31,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:31,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:31,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:31,681 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:31,681 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:31,682 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:31,682 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:31,682 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:36:31,682 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,682 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:31,682 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:31,682 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration1_Loop [2025-01-10 07:36:31,682 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:31,683 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:31,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:31,773 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:31,774 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:36:31,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:31,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:31,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:36:31,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:36:31,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:31,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:36:31,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:31,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:31,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:36:31,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:36:31,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:31,862 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:36:31,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:36:31,867 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:31,868 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:31,868 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:31,868 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:31,868 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:36:31,868 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,868 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:31,868 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:31,868 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration1_Loop [2025-01-10 07:36:31,868 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:31,868 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:31,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:31,941 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:31,945 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:36:31,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:31,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:31,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:36:31,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:36:31,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:36:31,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:36:31,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:36:31,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:36:31,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:36:31,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:36:31,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:36:31,991 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:36:32,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:36:32,007 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:36:32,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:32,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:32,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:32,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:36:32,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:36:32,016 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:36:32,017 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:36:32,017 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 Supporting invariants [] [2025-01-10 07:36:32,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:36:32,026 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:36:32,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:32,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:36:32,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:36:32,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:32,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:32,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:36:32,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:32,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:32,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:32,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:32,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:32,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:36:32,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:32,352 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2025-01-10 07:36:32,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18431 states, 18430 states have (on average 1.8737384698860553) internal successors, (34533), 18430 states have internal predecessors, (34533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:33,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:36:34,176 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18431 states, 18430 states have (on average 1.8737384698860553) internal successors, (34533), 18430 states have internal predecessors, (34533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48030 states and 89932 transitions. Complement of second has 18 states. [2025-01-10 07:36:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-01-10 07:36:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62244 transitions. [2025-01-10 07:36:34,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 62244 transitions. Stem has 34 letters. Loop has 7 letters. [2025-01-10 07:36:34,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:34,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 62244 transitions. Stem has 41 letters. Loop has 7 letters. [2025-01-10 07:36:34,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:34,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 62244 transitions. Stem has 34 letters. Loop has 14 letters. [2025-01-10 07:36:34,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:34,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48030 states and 89932 transitions. [2025-01-10 07:36:34,993 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 8173 [2025-01-10 07:36:35,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48030 states to 33158 states and 62067 transitions. [2025-01-10 07:36:35,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33128 [2025-01-10 07:36:35,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33130 [2025-01-10 07:36:35,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33158 states and 62067 transitions. [2025-01-10 07:36:35,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:35,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33158 states and 62067 transitions. [2025-01-10 07:36:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33158 states and 62067 transitions. [2025-01-10 07:36:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33158 to 33131. [2025-01-10 07:36:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33131 states, 33131 states have (on average 1.872174096767378) internal successors, (62027), 33130 states have internal predecessors, (62027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33131 states to 33131 states and 62027 transitions. [2025-01-10 07:36:36,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33131 states and 62027 transitions. [2025-01-10 07:36:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:36,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:36:36,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:36:36,394 INFO L87 Difference]: Start difference. First operand 33131 states and 62027 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:36,970 INFO L93 Difference]: Finished difference Result 33113 states and 61947 transitions. [2025-01-10 07:36:36,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33113 states and 61947 transitions. [2025-01-10 07:36:37,309 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 8157 [2025-01-10 07:36:37,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33113 states to 33104 states and 61938 transitions. [2025-01-10 07:36:37,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33086 [2025-01-10 07:36:37,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33086 [2025-01-10 07:36:37,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33104 states and 61938 transitions. [2025-01-10 07:36:37,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:37,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33104 states and 61938 transitions. [2025-01-10 07:36:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33104 states and 61938 transitions. [2025-01-10 07:36:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33104 to 18417. [2025-01-10 07:36:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18417 states, 18417 states have (on average 1.8710430580441983) internal successors, (34459), 18416 states have internal predecessors, (34459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18417 states to 18417 states and 34459 transitions. [2025-01-10 07:36:37,878 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18417 states and 34459 transitions. [2025-01-10 07:36:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:36:37,880 INFO L432 stractBuchiCegarLoop]: Abstraction has 18417 states and 34459 transitions. [2025-01-10 07:36:37,880 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:36:37,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18417 states and 34459 transitions. [2025-01-10 07:36:37,935 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4121 [2025-01-10 07:36:37,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:37,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:37,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:37,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:37,938 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume !(1 == ~prevDir~0);" "assume 0 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 1;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0;" [2025-01-10 07:36:37,939 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i~3#1 < 5;" "assume !(0 == existInLiftCallsInDirection_~i~3#1);" "assume !(1 == existInLiftCallsInDirection_~i~3#1);" "assume !(2 == existInLiftCallsInDirection_~i~3#1);" "assume !(3 == existInLiftCallsInDirection_~i~3#1);" "assume !(4 == existInLiftCallsInDirection_~i~3#1);" "existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1;" [2025-01-10 07:36:37,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1974407218, now seen corresponding path program 1 times [2025-01-10 07:36:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:37,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427320965] [2025-01-10 07:36:37,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:37,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 07:36:37,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 07:36:37,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:37,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:38,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427320965] [2025-01-10 07:36:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427320965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:38,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:38,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129546036] [2025-01-10 07:36:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:38,071 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:38,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1453392245, now seen corresponding path program 1 times [2025-01-10 07:36:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:38,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70721135] [2025-01-10 07:36:38,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:38,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:38,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:38,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:38,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:38,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:38,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:38,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:38,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:38,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:38,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:38,129 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:38,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:38,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:38,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:38,129 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:36:38,130 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:38,130 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:38,130 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:38,130 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration2_Loop [2025-01-10 07:36:38,130 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:38,130 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:38,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:38,166 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:38,167 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:36:38,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:38,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:38,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:36:38,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:36:38,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:38,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:36:38,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:38,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:38,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:38,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:36:38,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:36:38,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:38,218 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:36:38,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:38,222 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:38,222 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:38,222 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:38,223 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:38,223 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:36:38,223 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:38,223 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:38,223 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:38,223 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration2_Loop [2025-01-10 07:36:38,223 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:38,223 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:38,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:38,260 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:38,261 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:36:38,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:38,263 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:38,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:36:38,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:36:38,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:36:38,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:36:38,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:36:38,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:36:38,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:36:38,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:36:38,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:36:38,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:36:38,403 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:36:38,403 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:36:38,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:38,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:38,405 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:38,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:36:38,410 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:36:38,410 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:36:38,410 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:36:38,410 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 Supporting invariants [] [2025-01-10 07:36:38,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:36:38,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:36:38,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:38,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 07:36:38,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 07:36:38,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:38,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:38,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:36:38,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:38,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:36:38,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:36:38,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:38,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:38,535 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:36:38,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:38,646 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2025-01-10 07:36:38,646 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18417 states and 34459 transitions. cyclomatic complexity: 16076 Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:39,291 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18417 states and 34459 transitions. cyclomatic complexity: 16076. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33160 states and 62023 transitions. Complement of second has 17 states. [2025-01-10 07:36:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-01-10 07:36:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34445 transitions. [2025-01-10 07:36:39,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 34445 transitions. Stem has 37 letters. Loop has 7 letters. [2025-01-10 07:36:39,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:39,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 34445 transitions. Stem has 44 letters. Loop has 7 letters. [2025-01-10 07:36:39,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:39,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 34445 transitions. Stem has 37 letters. Loop has 14 letters. [2025-01-10 07:36:39,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:39,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33160 states and 62023 transitions. [2025-01-10 07:36:39,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:39,644 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 8171 [2025-01-10 07:36:39,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33160 states to 33154 states and 62017 transitions. [2025-01-10 07:36:39,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33106 [2025-01-10 07:36:39,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33108 [2025-01-10 07:36:39,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33154 states and 62017 transitions. [2025-01-10 07:36:39,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:39,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33154 states and 62017 transitions. [2025-01-10 07:36:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33154 states and 62017 transitions. [2025-01-10 07:36:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33154 to 18440. [2025-01-10 07:36:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18440 states, 18440 states have (on average 1.870824295010846) internal successors, (34498), 18439 states have internal predecessors, (34498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18440 states to 18440 states and 34498 transitions. [2025-01-10 07:36:40,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18440 states and 34498 transitions. [2025-01-10 07:36:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:40,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:40,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:40,053 INFO L87 Difference]: Start difference. First operand 18440 states and 34498 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:40,487 INFO L93 Difference]: Finished difference Result 18458 states and 34516 transitions. [2025-01-10 07:36:40,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18458 states and 34516 transitions. [2025-01-10 07:36:40,564 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4125 [2025-01-10 07:36:40,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18458 states to 18458 states and 34516 transitions. [2025-01-10 07:36:40,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18422 [2025-01-10 07:36:40,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18422 [2025-01-10 07:36:40,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18458 states and 34516 transitions. [2025-01-10 07:36:40,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:40,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18458 states and 34516 transitions. [2025-01-10 07:36:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18458 states and 34516 transitions. [2025-01-10 07:36:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18458 to 18455. [2025-01-10 07:36:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18455 states, 18455 states have (on average 1.8701164995936062) internal successors, (34513), 18454 states have internal predecessors, (34513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18455 states to 18455 states and 34513 transitions. [2025-01-10 07:36:40,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18455 states and 34513 transitions. [2025-01-10 07:36:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:40,898 INFO L432 stractBuchiCegarLoop]: Abstraction has 18455 states and 34513 transitions. [2025-01-10 07:36:40,898 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:36:40,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18455 states and 34513 transitions. [2025-01-10 07:36:41,052 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4125 [2025-01-10 07:36:41,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:41,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:41,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:41,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:41,057 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0;" "assume existInLiftCallsInDirection_~i~3#1 < 5;" [2025-01-10 07:36:41,059 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == existInLiftCallsInDirection_~i~3#1;" "assume !(0 != ~floorButtons_0~0);" "assume !(1 == existInLiftCallsInDirection_~i~3#1);" "assume !(2 == existInLiftCallsInDirection_~i~3#1);" "assume !(3 == existInLiftCallsInDirection_~i~3#1);" "assume !(4 == existInLiftCallsInDirection_~i~3#1);" "existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1;" "assume existInLiftCallsInDirection_~i~3#1 < 5;" [2025-01-10 07:36:41,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1800201021, now seen corresponding path program 1 times [2025-01-10 07:36:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:41,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390241964] [2025-01-10 07:36:41,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:41,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:36:41,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:36:41,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:41,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:41,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390241964] [2025-01-10 07:36:41,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390241964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:41,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:41,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:36:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634000165] [2025-01-10 07:36:41,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:41,164 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:41,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:41,164 INFO L85 PathProgramCache]: Analyzing trace with hash 446379969, now seen corresponding path program 1 times [2025-01-10 07:36:41,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:41,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554063418] [2025-01-10 07:36:41,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:41,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:36:41,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:36:41,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:41,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:41,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:41,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:36:41,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:36:41,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:41,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:41,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:41,210 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:41,210 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:41,210 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:41,210 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:41,210 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:36:41,210 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:41,210 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:41,210 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:41,210 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration3_Loop [2025-01-10 07:36:41,210 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:41,210 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:41,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:41,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:41,233 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:41,233 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:36:41,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:41,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:41,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:41,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:36:41,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:36:41,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:41,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:41,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:41,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:41,259 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:41,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:36:41,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:36:41,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:36:41,273 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:36:41,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:41,278 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:36:41,278 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:36:41,278 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:36:41,279 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:36:41,279 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:36:41,279 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:41,279 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:36:41,279 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:36:41,279 INFO L132 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration3_Loop [2025-01-10 07:36:41,279 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:36:41,279 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:36:41,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:41,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:36:41,331 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:36:41,332 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:36:41,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:41,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:41,334 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:41,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:36:41,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:36:41,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:36:41,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:36:41,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:36:41,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:36:41,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:36:41,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:36:41,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:36:41,350 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:36:41,352 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:36:41,352 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:36:41,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:36:41,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:36:41,354 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:36:41,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:36:41,357 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:36:41,357 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:36:41,357 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:36:41,357 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -2*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 + 1 Supporting invariants [] [2025-01-10 07:36:41,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:41,363 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:36:41,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:41,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 07:36:41,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 07:36:41,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:41,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:41,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:36:41,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:41,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:36:41,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:36:41,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:41,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:41,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:36:41,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:36:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:41,552 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 07:36:41,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18455 states and 34513 transitions. cyclomatic complexity: 16093 Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:42,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-01-10 07:36:42,519 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18455 states and 34513 transitions. cyclomatic complexity: 16093. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47938 states and 89642 transitions. Complement of second has 8 states. [2025-01-10 07:36:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 07:36:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61935 transitions. [2025-01-10 07:36:42,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61935 transitions. Stem has 39 letters. Loop has 8 letters. [2025-01-10 07:36:42,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:42,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61935 transitions. Stem has 47 letters. Loop has 8 letters. [2025-01-10 07:36:42,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:42,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61935 transitions. Stem has 39 letters. Loop has 16 letters. [2025-01-10 07:36:42,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:36:42,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47938 states and 89642 transitions. [2025-01-10 07:36:42,715 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 8159 [2025-01-10 07:36:42,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47938 states to 33197 states and 62070 transitions. [2025-01-10 07:36:42,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33114 [2025-01-10 07:36:42,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33118 [2025-01-10 07:36:42,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33197 states and 62070 transitions. [2025-01-10 07:36:42,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:42,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33197 states and 62070 transitions. [2025-01-10 07:36:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33197 states and 62070 transitions. [2025-01-10 07:36:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33197 to 18499. [2025-01-10 07:36:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18499 states, 18499 states have (on average 1.8691821179523218) internal successors, (34578), 18498 states have internal predecessors, (34578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18499 states to 18499 states and 34578 transitions. [2025-01-10 07:36:43,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18499 states and 34578 transitions. [2025-01-10 07:36:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:43,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:36:43,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:36:43,270 INFO L87 Difference]: Start difference. First operand 18499 states and 34578 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:43,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:43,538 INFO L93 Difference]: Finished difference Result 18465 states and 34510 transitions. [2025-01-10 07:36:43,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18465 states and 34510 transitions. [2025-01-10 07:36:43,629 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:43,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18465 states to 18465 states and 34510 transitions. [2025-01-10 07:36:43,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18386 [2025-01-10 07:36:43,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18386 [2025-01-10 07:36:43,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18465 states and 34510 transitions. [2025-01-10 07:36:43,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:43,715 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18465 states and 34510 transitions. [2025-01-10 07:36:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18465 states and 34510 transitions. [2025-01-10 07:36:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18465 to 18465. [2025-01-10 07:36:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18465 states, 18465 states have (on average 1.868941240184132) internal successors, (34510), 18464 states have internal predecessors, (34510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18465 states to 18465 states and 34510 transitions. [2025-01-10 07:36:44,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18465 states and 34510 transitions. [2025-01-10 07:36:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:36:44,111 INFO L432 stractBuchiCegarLoop]: Abstraction has 18465 states and 34510 transitions. [2025-01-10 07:36:44,111 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:36:44,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18465 states and 34510 transitions. [2025-01-10 07:36:44,154 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:44,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:44,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:44,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:44,156 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:44,156 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:44,157 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:44,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash 790459852, now seen corresponding path program 1 times [2025-01-10 07:36:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592510336] [2025-01-10 07:36:44,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:44,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 07:36:44,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 07:36:44,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:44,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:44,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:44,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592510336] [2025-01-10 07:36:44,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592510336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:44,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:44,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:36:44,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204789747] [2025-01-10 07:36:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:44,258 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:44,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 1 times [2025-01-10 07:36:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:44,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808320230] [2025-01-10 07:36:44,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:44,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:44,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:44,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:44,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:44,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:44,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:44,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:44,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:44,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:44,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:44,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:44,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:36:44,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:36:44,303 INFO L87 Difference]: Start difference. First operand 18465 states and 34510 transitions. cyclomatic complexity: 16082 Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:44,914 INFO L93 Difference]: Finished difference Result 18473 states and 34517 transitions. [2025-01-10 07:36:44,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18473 states and 34517 transitions. [2025-01-10 07:36:45,017 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:45,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18473 states to 18473 states and 34517 transitions. [2025-01-10 07:36:45,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18394 [2025-01-10 07:36:45,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18394 [2025-01-10 07:36:45,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18473 states and 34517 transitions. [2025-01-10 07:36:45,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:45,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18473 states and 34517 transitions. [2025-01-10 07:36:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18473 states and 34517 transitions. [2025-01-10 07:36:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18473 to 18465. [2025-01-10 07:36:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18465 states, 18465 states have (on average 1.8686163011102086) internal successors, (34504), 18464 states have internal predecessors, (34504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18465 states to 18465 states and 34504 transitions. [2025-01-10 07:36:45,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18465 states and 34504 transitions. [2025-01-10 07:36:45,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:36:45,393 INFO L432 stractBuchiCegarLoop]: Abstraction has 18465 states and 34504 transitions. [2025-01-10 07:36:45,393 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:36:45,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18465 states and 34504 transitions. [2025-01-10 07:36:45,593 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:45,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:45,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:45,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:45,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:45,594 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:45,594 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:45,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1011904400, now seen corresponding path program 1 times [2025-01-10 07:36:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517410776] [2025-01-10 07:36:45,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:45,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 07:36:45,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 07:36:45,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:45,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:45,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517410776] [2025-01-10 07:36:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517410776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:45,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:45,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:45,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324377242] [2025-01-10 07:36:45,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:45,679 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:45,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 2 times [2025-01-10 07:36:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:45,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573340850] [2025-01-10 07:36:45,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:36:45,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:45,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:45,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:45,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:36:45,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:45,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:45,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:45,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:45,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:45,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:45,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:45,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:45,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:45,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:45,734 INFO L87 Difference]: Start difference. First operand 18465 states and 34504 transitions. cyclomatic complexity: 16076 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:45,983 INFO L93 Difference]: Finished difference Result 18469 states and 34507 transitions. [2025-01-10 07:36:45,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18469 states and 34507 transitions. [2025-01-10 07:36:46,176 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:46,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18469 states to 18469 states and 34507 transitions. [2025-01-10 07:36:46,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18390 [2025-01-10 07:36:46,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18390 [2025-01-10 07:36:46,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18469 states and 34507 transitions. [2025-01-10 07:36:46,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:46,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18469 states and 34507 transitions. [2025-01-10 07:36:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states and 34507 transitions. [2025-01-10 07:36:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2025-01-10 07:36:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18469 states, 18469 states have (on average 1.8683740321620013) internal successors, (34507), 18468 states have internal predecessors, (34507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 34507 transitions. [2025-01-10 07:36:46,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18469 states and 34507 transitions. [2025-01-10 07:36:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:46,517 INFO L432 stractBuchiCegarLoop]: Abstraction has 18469 states and 34507 transitions. [2025-01-10 07:36:46,517 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:36:46,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18469 states and 34507 transitions. [2025-01-10 07:36:46,576 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:46,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:46,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:46,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:46,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:46,578 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume 1 == callOnFloor_~floorID#1;~calls_1~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:46,579 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:46,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash -793620501, now seen corresponding path program 1 times [2025-01-10 07:36:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:46,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914362542] [2025-01-10 07:36:46,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:46,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:46,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 07:36:46,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 07:36:46,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:46,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914362542] [2025-01-10 07:36:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914362542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:46,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:46,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523206337] [2025-01-10 07:36:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:46,680 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:46,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 3 times [2025-01-10 07:36:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345437427] [2025-01-10 07:36:46,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:36:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:46,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:46,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:46,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:36:46,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:46,697 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:46,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:46,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:46,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:46,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:46,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:46,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:46,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:46,742 INFO L87 Difference]: Start difference. First operand 18469 states and 34507 transitions. cyclomatic complexity: 16075 Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:47,256 INFO L93 Difference]: Finished difference Result 18475 states and 34512 transitions. [2025-01-10 07:36:47,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18475 states and 34512 transitions. [2025-01-10 07:36:47,328 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:47,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18475 states to 18475 states and 34512 transitions. [2025-01-10 07:36:47,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18396 [2025-01-10 07:36:47,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18396 [2025-01-10 07:36:47,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18475 states and 34512 transitions. [2025-01-10 07:36:47,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:47,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18475 states and 34512 transitions. [2025-01-10 07:36:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18475 states and 34512 transitions. [2025-01-10 07:36:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18475 to 18475. [2025-01-10 07:36:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18475 states, 18475 states have (on average 1.8680378890392422) internal successors, (34512), 18474 states have internal predecessors, (34512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18475 states to 18475 states and 34512 transitions. [2025-01-10 07:36:47,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18475 states and 34512 transitions. [2025-01-10 07:36:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:47,666 INFO L432 stractBuchiCegarLoop]: Abstraction has 18475 states and 34512 transitions. [2025-01-10 07:36:47,666 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:36:47,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18475 states and 34512 transitions. [2025-01-10 07:36:47,714 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:47,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:47,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:47,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:47,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:47,716 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:47,716 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:47,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash -775218549, now seen corresponding path program 1 times [2025-01-10 07:36:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:47,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642498135] [2025-01-10 07:36:47,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:47,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:47,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 07:36:47,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 07:36:47,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:47,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:47,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642498135] [2025-01-10 07:36:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642498135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:47,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:47,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407616472] [2025-01-10 07:36:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:47,795 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:47,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 4 times [2025-01-10 07:36:47,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:47,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091192090] [2025-01-10 07:36:47,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:36:47,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:47,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:36:47,809 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:47,809 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:36:47,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:47,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:47,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:47,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:47,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:47,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:47,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:47,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:47,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:47,835 INFO L87 Difference]: Start difference. First operand 18475 states and 34512 transitions. cyclomatic complexity: 16074 Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:48,251 INFO L93 Difference]: Finished difference Result 18483 states and 34519 transitions. [2025-01-10 07:36:48,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18483 states and 34519 transitions. [2025-01-10 07:36:48,312 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:48,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18483 states to 18483 states and 34519 transitions. [2025-01-10 07:36:48,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18404 [2025-01-10 07:36:48,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18404 [2025-01-10 07:36:48,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18483 states and 34519 transitions. [2025-01-10 07:36:48,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:48,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18483 states and 34519 transitions. [2025-01-10 07:36:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18483 states and 34519 transitions. [2025-01-10 07:36:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18483 to 18483. [2025-01-10 07:36:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18483 states, 18483 states have (on average 1.867608072282638) internal successors, (34519), 18482 states have internal predecessors, (34519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18483 states to 18483 states and 34519 transitions. [2025-01-10 07:36:48,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18483 states and 34519 transitions. [2025-01-10 07:36:48,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:48,591 INFO L432 stractBuchiCegarLoop]: Abstraction has 18483 states and 34519 transitions. [2025-01-10 07:36:48,591 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:36:48,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18483 states and 34519 transitions. [2025-01-10 07:36:48,636 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:48,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:48,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:48,637 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:48,637 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:48,637 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume 0 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:48,637 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:48,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash -49659002, now seen corresponding path program 1 times [2025-01-10 07:36:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:48,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192608425] [2025-01-10 07:36:48,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:48,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:48,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 07:36:48,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 07:36:48,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:48,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:48,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:48,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192608425] [2025-01-10 07:36:48,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192608425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:48,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:48,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:36:48,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436041593] [2025-01-10 07:36:48,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:48,882 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:48,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 5 times [2025-01-10 07:36:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499593991] [2025-01-10 07:36:48,883 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:36:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:48,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:48,895 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:48,895 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:36:48,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:48,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:48,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:48,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:48,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:48,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:48,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:48,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:36:48,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:36:48,917 INFO L87 Difference]: Start difference. First operand 18483 states and 34519 transitions. cyclomatic complexity: 16073 Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:49,211 INFO L93 Difference]: Finished difference Result 18469 states and 34493 transitions. [2025-01-10 07:36:49,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18469 states and 34493 transitions. [2025-01-10 07:36:49,269 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:49,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18469 states to 18469 states and 34493 transitions. [2025-01-10 07:36:49,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18390 [2025-01-10 07:36:49,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18390 [2025-01-10 07:36:49,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18469 states and 34493 transitions. [2025-01-10 07:36:49,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:49,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18469 states and 34493 transitions. [2025-01-10 07:36:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states and 34493 transitions. [2025-01-10 07:36:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2025-01-10 07:36:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18469 states, 18469 states have (on average 1.8676160051978992) internal successors, (34493), 18468 states have internal predecessors, (34493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 34493 transitions. [2025-01-10 07:36:49,692 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18469 states and 34493 transitions. [2025-01-10 07:36:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:36:49,693 INFO L432 stractBuchiCegarLoop]: Abstraction has 18469 states and 34493 transitions. [2025-01-10 07:36:49,693 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:36:49,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18469 states and 34493 transitions. [2025-01-10 07:36:49,750 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:49,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:49,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:49,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:49,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:49,751 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume 1 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_1~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume 1 == callOnFloor_~floorID#1;~calls_1~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:49,752 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:49,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1777575644, now seen corresponding path program 1 times [2025-01-10 07:36:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399763528] [2025-01-10 07:36:49,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:49,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 07:36:49,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 07:36:49,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:49,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399763528] [2025-01-10 07:36:49,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399763528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:49,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:49,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:36:49,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418000439] [2025-01-10 07:36:49,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:49,849 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:49,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 6 times [2025-01-10 07:36:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:49,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055883037] [2025-01-10 07:36:49,850 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:36:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:49,863 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:49,864 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:49,865 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:36:49,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:49,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:49,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:49,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:49,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:49,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:49,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:49,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:36:49,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:36:49,886 INFO L87 Difference]: Start difference. First operand 18469 states and 34493 transitions. cyclomatic complexity: 16061 Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:50,449 INFO L93 Difference]: Finished difference Result 18463 states and 34480 transitions. [2025-01-10 07:36:50,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18463 states and 34480 transitions. [2025-01-10 07:36:50,499 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:50,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18463 states to 18463 states and 34480 transitions. [2025-01-10 07:36:50,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18384 [2025-01-10 07:36:50,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18384 [2025-01-10 07:36:50,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18463 states and 34480 transitions. [2025-01-10 07:36:50,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:50,550 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18463 states and 34480 transitions. [2025-01-10 07:36:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18463 states and 34480 transitions. [2025-01-10 07:36:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18463 to 18463. [2025-01-10 07:36:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18463 states, 18463 states have (on average 1.8675188214266372) internal successors, (34480), 18462 states have internal predecessors, (34480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18463 states to 18463 states and 34480 transitions. [2025-01-10 07:36:50,849 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18463 states and 34480 transitions. [2025-01-10 07:36:50,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:36:50,850 INFO L432 stractBuchiCegarLoop]: Abstraction has 18463 states and 34480 transitions. [2025-01-10 07:36:50,851 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:36:50,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18463 states and 34480 transitions. [2025-01-10 07:36:50,894 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:50,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:50,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:50,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:50,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:50,895 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:50,895 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:50,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1937928445, now seen corresponding path program 1 times [2025-01-10 07:36:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:50,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579311250] [2025-01-10 07:36:50,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:50,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 07:36:50,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 07:36:50,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:50,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579311250] [2025-01-10 07:36:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579311250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:51,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:51,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:36:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688032192] [2025-01-10 07:36:51,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:51,027 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 7 times [2025-01-10 07:36:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325132295] [2025-01-10 07:36:51,027 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:36:51,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:51,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:51,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:51,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:51,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:51,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:51,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:51,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:51,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:51,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:51,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:51,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:51,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:51,088 INFO L87 Difference]: Start difference. First operand 18463 states and 34480 transitions. cyclomatic complexity: 16054 Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:51,700 INFO L93 Difference]: Finished difference Result 18479 states and 34492 transitions. [2025-01-10 07:36:51,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18479 states and 34492 transitions. [2025-01-10 07:36:51,756 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:51,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18479 states to 18479 states and 34492 transitions. [2025-01-10 07:36:51,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18400 [2025-01-10 07:36:51,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18400 [2025-01-10 07:36:51,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18479 states and 34492 transitions. [2025-01-10 07:36:51,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:51,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18479 states and 34492 transitions. [2025-01-10 07:36:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18479 states and 34492 transitions. [2025-01-10 07:36:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18479 to 18463. [2025-01-10 07:36:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18463 states, 18463 states have (on average 1.8670855223961436) internal successors, (34472), 18462 states have internal predecessors, (34472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18463 states to 18463 states and 34472 transitions. [2025-01-10 07:36:52,001 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18463 states and 34472 transitions. [2025-01-10 07:36:52,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:36:52,002 INFO L432 stractBuchiCegarLoop]: Abstraction has 18463 states and 34472 transitions. [2025-01-10 07:36:52,002 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:36:52,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18463 states and 34472 transitions. [2025-01-10 07:36:52,050 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4123 [2025-01-10 07:36:52,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:52,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:52,050 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:52,050 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:52,051 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:52,051 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:52,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:52,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1066972028, now seen corresponding path program 1 times [2025-01-10 07:36:52,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:52,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356090804] [2025-01-10 07:36:52,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:52,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:52,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 07:36:52,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 07:36:52,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:52,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:52,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:52,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356090804] [2025-01-10 07:36:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356090804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:52,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:52,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:36:52,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142670840] [2025-01-10 07:36:52,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:52,197 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:52,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 8 times [2025-01-10 07:36:52,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:52,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729102] [2025-01-10 07:36:52,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:36:52,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:52,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:52,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:52,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:36:52,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:52,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:52,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:52,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:52,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:52,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:52,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:52,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:36:52,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:36:52,257 INFO L87 Difference]: Start difference. First operand 18463 states and 34472 transitions. cyclomatic complexity: 16046 Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:53,406 INFO L93 Difference]: Finished difference Result 34398 states and 64394 transitions. [2025-01-10 07:36:53,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34398 states and 64394 transitions. [2025-01-10 07:36:53,514 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 7106 [2025-01-10 07:36:53,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34398 states to 34398 states and 64394 transitions. [2025-01-10 07:36:53,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34240 [2025-01-10 07:36:53,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34240 [2025-01-10 07:36:53,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34398 states and 64394 transitions. [2025-01-10 07:36:53,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:53,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34398 states and 64394 transitions. [2025-01-10 07:36:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34398 states and 64394 transitions. [2025-01-10 07:36:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34398 to 29386. [2025-01-10 07:36:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29386 states, 29386 states have (on average 1.868440754100592) internal successors, (54906), 29385 states have internal predecessors, (54906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29386 states to 29386 states and 54906 transitions. [2025-01-10 07:36:54,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29386 states and 54906 transitions. [2025-01-10 07:36:54,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:36:54,206 INFO L432 stractBuchiCegarLoop]: Abstraction has 29386 states and 54906 transitions. [2025-01-10 07:36:54,207 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:36:54,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29386 states and 54906 transitions. [2025-01-10 07:36:54,293 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 7106 [2025-01-10 07:36:54,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:54,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:54,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:54,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:54,298 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume !(0 != timeShift_~tmp~29#1);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;havoc timeShift__wrappee__executivefloor_~tmp~28#1;havoc timeShift__wrappee__executivefloor_~tmp___0~12#1;havoc timeShift__wrappee__executivefloor_~tmp___1~7#1;havoc timeShift__wrappee__executivefloor_~tmp___2~5#1;havoc timeShift__wrappee__executivefloor_~tmp___3~4#1;havoc timeShift__wrappee__executivefloor_~tmp___4~3#1;havoc timeShift__wrappee__executivefloor_~tmp___5~2#1;havoc timeShift__wrappee__executivefloor_~tmp___6~2#1;havoc timeShift__wrappee__executivefloor_~tmp___7~2#1;havoc timeShift__wrappee__executivefloor_~tmp___8~2#1;havoc timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :begin_inline_stopRequestedAtCurrentFloor } true;havoc stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~27#1;havoc stopRequestedAtCurrentFloor_~tmp~26#1;havoc stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedAtCurrentFloor_#t~ret88#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~26#1 := stopRequestedAtCurrentFloor_#t~ret88#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1;" "assume 0 != stopRequestedAtCurrentFloor_~tmp~26#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedAtCurrentFloor_#t~ret89#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~10#1 := stopRequestedAtCurrentFloor_#t~ret89#1;havoc stopRequestedAtCurrentFloor_#t~ret89#1;" "assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10#1);stopRequestedAtCurrentFloor_~retValue_acc~27#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1;" "timeShift__wrappee__executivefloor_#t~ret104#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret104#1;havoc timeShift__wrappee__executivefloor_#t~ret104#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume !(1 == ~doorState~0);" "assume { :begin_inline_stopRequestedInDirection } true;stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1 := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;stopRequestedInDirection_~dir#1 := stopRequestedInDirection_#in~dir#1;stopRequestedInDirection_~respectFloorCalls#1 := stopRequestedInDirection_#in~respectFloorCalls#1;stopRequestedInDirection_~respectInLiftCalls#1 := stopRequestedInDirection_#in~respectInLiftCalls#1;havoc stopRequestedInDirection_~retValue_acc~23#1;havoc stopRequestedInDirection_~tmp~22#1;havoc stopRequestedInDirection_~tmp___0~7#1;havoc stopRequestedInDirection_~__cil_tmp7~6#1;havoc stopRequestedInDirection_~__cil_tmp8~7#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedInDirection_#t~ret79#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~7#1 := stopRequestedInDirection_#t~ret79#1;havoc stopRequestedInDirection_#t~ret79#1;" "assume 0 != stopRequestedInDirection_~tmp___0~7#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedInDirection_#t~ret80#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~22#1 := stopRequestedInDirection_#t~ret80#1;havoc stopRequestedInDirection_#t~ret80#1;stopRequestedInDirection_~__cil_tmp7~6#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~7#1 := (if stopRequestedInDirection_~tmp~22#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23#1 := (if stopRequestedInDirection_~__cil_tmp8~7#1 == stopRequestedInDirection_~__cil_tmp7~6#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~23#1;" "timeShift__wrappee__executivefloor_#t~ret111#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;havoc stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1;assume { :end_inline_stopRequestedInDirection } true;timeShift__wrappee__executivefloor_~tmp___8~2#1 := timeShift__wrappee__executivefloor_#t~ret111#1;havoc timeShift__wrappee__executivefloor_#t~ret111#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~23#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :end_inline_timeShift__wrappee__executivefloor } true;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:54,298 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:54,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash -953121817, now seen corresponding path program 1 times [2025-01-10 07:36:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:54,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186117610] [2025-01-10 07:36:54,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:54,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:54,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 07:36:54,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 07:36:54,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:54,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:54,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186117610] [2025-01-10 07:36:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186117610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:54,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:54,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 07:36:54,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172027551] [2025-01-10 07:36:54,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:54,460 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:54,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 9 times [2025-01-10 07:36:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831489791] [2025-01-10 07:36:54,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:36:54,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:54,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:54,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:54,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:36:54,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:54,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:54,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:54,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:54,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:54,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:54,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:54,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:54,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:36:54,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:36:54,520 INFO L87 Difference]: Start difference. First operand 29386 states and 54906 transitions. cyclomatic complexity: 25594 Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:36:55,398 INFO L93 Difference]: Finished difference Result 28510 states and 52935 transitions. [2025-01-10 07:36:55,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28510 states and 52935 transitions. [2025-01-10 07:36:55,488 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8376 [2025-01-10 07:36:55,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28510 states to 28510 states and 52935 transitions. [2025-01-10 07:36:55,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28273 [2025-01-10 07:36:55,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28273 [2025-01-10 07:36:55,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28510 states and 52935 transitions. [2025-01-10 07:36:55,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:36:55,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28510 states and 52935 transitions. [2025-01-10 07:36:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28510 states and 52935 transitions. [2025-01-10 07:36:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28510 to 28510. [2025-01-10 07:36:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28510 states, 28510 states have (on average 1.8567169414240616) internal successors, (52935), 28509 states have internal predecessors, (52935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:36:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28510 states to 28510 states and 52935 transitions. [2025-01-10 07:36:55,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28510 states and 52935 transitions. [2025-01-10 07:36:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:36:55,863 INFO L432 stractBuchiCegarLoop]: Abstraction has 28510 states and 52935 transitions. [2025-01-10 07:36:55,863 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-01-10 07:36:55,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28510 states and 52935 transitions. [2025-01-10 07:36:55,927 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8376 [2025-01-10 07:36:55,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:36:55,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:36:55,928 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:36:55,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:36:55,928 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume !(~weight~0 > ~maximumWeight~0);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;havoc timeShift__wrappee__executivefloor_~tmp~28#1;havoc timeShift__wrappee__executivefloor_~tmp___0~12#1;havoc timeShift__wrappee__executivefloor_~tmp___1~7#1;havoc timeShift__wrappee__executivefloor_~tmp___2~5#1;havoc timeShift__wrappee__executivefloor_~tmp___3~4#1;havoc timeShift__wrappee__executivefloor_~tmp___4~3#1;havoc timeShift__wrappee__executivefloor_~tmp___5~2#1;havoc timeShift__wrappee__executivefloor_~tmp___6~2#1;havoc timeShift__wrappee__executivefloor_~tmp___7~2#1;havoc timeShift__wrappee__executivefloor_~tmp___8~2#1;havoc timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :begin_inline_stopRequestedAtCurrentFloor } true;havoc stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~27#1;havoc stopRequestedAtCurrentFloor_~tmp~26#1;havoc stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedAtCurrentFloor_#t~ret88#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~26#1 := stopRequestedAtCurrentFloor_#t~ret88#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1;" "assume 0 != stopRequestedAtCurrentFloor_~tmp~26#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedAtCurrentFloor_#t~ret89#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~10#1 := stopRequestedAtCurrentFloor_#t~ret89#1;havoc stopRequestedAtCurrentFloor_#t~ret89#1;" "assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10#1);stopRequestedAtCurrentFloor_~retValue_acc~27#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1;" "timeShift__wrappee__executivefloor_#t~ret104#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret104#1;havoc timeShift__wrappee__executivefloor_#t~ret104#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume 1 == ~doorState~0;~doorState~0 := 0;" "assume { :begin_inline_stopRequestedInDirection } true;stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1 := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;stopRequestedInDirection_~dir#1 := stopRequestedInDirection_#in~dir#1;stopRequestedInDirection_~respectFloorCalls#1 := stopRequestedInDirection_#in~respectFloorCalls#1;stopRequestedInDirection_~respectInLiftCalls#1 := stopRequestedInDirection_#in~respectInLiftCalls#1;havoc stopRequestedInDirection_~retValue_acc~23#1;havoc stopRequestedInDirection_~tmp~22#1;havoc stopRequestedInDirection_~tmp___0~7#1;havoc stopRequestedInDirection_~__cil_tmp7~6#1;havoc stopRequestedInDirection_~__cil_tmp8~7#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedInDirection_#t~ret79#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~7#1 := stopRequestedInDirection_#t~ret79#1;havoc stopRequestedInDirection_#t~ret79#1;" "assume 0 != stopRequestedInDirection_~tmp___0~7#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedInDirection_#t~ret80#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~22#1 := stopRequestedInDirection_#t~ret80#1;havoc stopRequestedInDirection_#t~ret80#1;stopRequestedInDirection_~__cil_tmp7~6#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~7#1 := (if stopRequestedInDirection_~tmp~22#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23#1 := (if stopRequestedInDirection_~__cil_tmp8~7#1 == stopRequestedInDirection_~__cil_tmp7~6#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~23#1;" "timeShift__wrappee__executivefloor_#t~ret111#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;havoc stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1;assume { :end_inline_stopRequestedInDirection } true;timeShift__wrappee__executivefloor_~tmp___8~2#1 := timeShift__wrappee__executivefloor_#t~ret111#1;havoc timeShift__wrappee__executivefloor_#t~ret111#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~23#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :end_inline_timeShift__wrappee__executivefloor } true;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:36:55,929 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:36:55,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:55,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1488759182, now seen corresponding path program 1 times [2025-01-10 07:36:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:55,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007134670] [2025-01-10 07:36:55,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:36:55,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:55,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 07:36:55,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 07:36:55,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:55,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:36:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:36:56,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:36:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007134670] [2025-01-10 07:36:56,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007134670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:36:56,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:36:56,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:36:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690029296] [2025-01-10 07:36:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:36:56,005 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:36:56,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:36:56,006 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 10 times [2025-01-10 07:36:56,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:36:56,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859033021] [2025-01-10 07:36:56,006 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:36:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:36:56,022 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-01-10 07:36:56,025 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:56,025 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:36:56,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:56,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:36:56,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:36:56,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:36:56,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:36:56,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:36:56,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:36:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:36:56,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:36:56,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:36:56,056 INFO L87 Difference]: Start difference. First operand 28510 states and 52935 transitions. cyclomatic complexity: 24559 Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:37:01,902 INFO L93 Difference]: Finished difference Result 28510 states and 51680 transitions. [2025-01-10 07:37:01,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28510 states and 51680 transitions. [2025-01-10 07:37:01,979 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8376 [2025-01-10 07:37:02,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28510 states to 28510 states and 51680 transitions. [2025-01-10 07:37:02,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28273 [2025-01-10 07:37:02,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28273 [2025-01-10 07:37:02,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28510 states and 51680 transitions. [2025-01-10 07:37:02,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:37:02,059 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28510 states and 51680 transitions. [2025-01-10 07:37:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28510 states and 51680 transitions. [2025-01-10 07:37:02,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28510 to 28510. [2025-01-10 07:37:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28510 states, 28510 states have (on average 1.8126972991932655) internal successors, (51680), 28509 states have internal predecessors, (51680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28510 states to 28510 states and 51680 transitions. [2025-01-10 07:37:02,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28510 states and 51680 transitions. [2025-01-10 07:37:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:37:02,352 INFO L432 stractBuchiCegarLoop]: Abstraction has 28510 states and 51680 transitions. [2025-01-10 07:37:02,352 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-01-10 07:37:02,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28510 states and 51680 transitions. [2025-01-10 07:37:02,419 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 8376 [2025-01-10 07:37:02,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:37:02,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:37:02,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:37:02,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:37:02,420 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume !(~weight~0 > ~maximumWeight~0);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;havoc timeShift__wrappee__executivefloor_~tmp~28#1;havoc timeShift__wrappee__executivefloor_~tmp___0~12#1;havoc timeShift__wrappee__executivefloor_~tmp___1~7#1;havoc timeShift__wrappee__executivefloor_~tmp___2~5#1;havoc timeShift__wrappee__executivefloor_~tmp___3~4#1;havoc timeShift__wrappee__executivefloor_~tmp___4~3#1;havoc timeShift__wrappee__executivefloor_~tmp___5~2#1;havoc timeShift__wrappee__executivefloor_~tmp___6~2#1;havoc timeShift__wrappee__executivefloor_~tmp___7~2#1;havoc timeShift__wrappee__executivefloor_~tmp___8~2#1;havoc timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :begin_inline_stopRequestedAtCurrentFloor } true;havoc stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~27#1;havoc stopRequestedAtCurrentFloor_~tmp~26#1;havoc stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedAtCurrentFloor_#t~ret88#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~26#1 := stopRequestedAtCurrentFloor_#t~ret88#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1;" "assume 0 != stopRequestedAtCurrentFloor_~tmp~26#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedAtCurrentFloor_#t~ret89#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~10#1 := stopRequestedAtCurrentFloor_#t~ret89#1;havoc stopRequestedAtCurrentFloor_#t~ret89#1;" "assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10#1);stopRequestedAtCurrentFloor_~retValue_acc~27#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1;" "timeShift__wrappee__executivefloor_#t~ret104#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret104#1;havoc timeShift__wrappee__executivefloor_#t~ret104#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume 1 == ~doorState~0;~doorState~0 := 0;" "assume { :begin_inline_stopRequestedInDirection } true;stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1 := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;stopRequestedInDirection_~dir#1 := stopRequestedInDirection_#in~dir#1;stopRequestedInDirection_~respectFloorCalls#1 := stopRequestedInDirection_#in~respectFloorCalls#1;stopRequestedInDirection_~respectInLiftCalls#1 := stopRequestedInDirection_#in~respectInLiftCalls#1;havoc stopRequestedInDirection_~retValue_acc~23#1;havoc stopRequestedInDirection_~tmp~22#1;havoc stopRequestedInDirection_~tmp___0~7#1;havoc stopRequestedInDirection_~__cil_tmp7~6#1;havoc stopRequestedInDirection_~__cil_tmp8~7#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedInDirection_#t~ret79#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~7#1 := stopRequestedInDirection_#t~ret79#1;havoc stopRequestedInDirection_#t~ret79#1;" "assume 0 != stopRequestedInDirection_~tmp___0~7#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedInDirection_#t~ret80#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~22#1 := stopRequestedInDirection_#t~ret80#1;havoc stopRequestedInDirection_#t~ret80#1;stopRequestedInDirection_~__cil_tmp7~6#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~7#1 := (if stopRequestedInDirection_~tmp~22#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23#1 := (if stopRequestedInDirection_~__cil_tmp8~7#1 == stopRequestedInDirection_~__cil_tmp7~6#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~23#1;" "timeShift__wrappee__executivefloor_#t~ret111#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;havoc stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1;assume { :end_inline_stopRequestedInDirection } true;timeShift__wrappee__executivefloor_~tmp___8~2#1 := timeShift__wrappee__executivefloor_#t~ret111#1;havoc timeShift__wrappee__executivefloor_#t~ret111#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~23#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :end_inline_timeShift__wrappee__executivefloor } true;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:37:02,421 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:37:02,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2092609798, now seen corresponding path program 1 times [2025-01-10 07:37:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:02,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017910603] [2025-01-10 07:37:02,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:37:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:02,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 07:37:02,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 07:37:02,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:02,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:37:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:37:02,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:37:02,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017910603] [2025-01-10 07:37:02,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017910603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:37:02,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:37:02,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:37:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997213721] [2025-01-10 07:37:02,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:37:02,523 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:37:02,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:02,523 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 11 times [2025-01-10 07:37:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867346008] [2025-01-10 07:37:02,523 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:37:02,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:02,539 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:02,540 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:02,540 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:37:02,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:02,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:37:02,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:02,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:02,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:02,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:02,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:37:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:37:02,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:37:02,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:37:02,562 INFO L87 Difference]: Start difference. First operand 28510 states and 51680 transitions. cyclomatic complexity: 23304 Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:37:11,947 INFO L93 Difference]: Finished difference Result 58033 states and 103906 transitions. [2025-01-10 07:37:11,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58033 states and 103906 transitions. [2025-01-10 07:37:12,292 INFO L131 ngComponentsAnalysis]: Automaton has 244 accepting balls. 17030 [2025-01-10 07:37:12,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58033 states to 58033 states and 103906 transitions. [2025-01-10 07:37:12,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57559 [2025-01-10 07:37:12,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57559 [2025-01-10 07:37:12,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58033 states and 103906 transitions. [2025-01-10 07:37:12,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:37:12,530 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58033 states and 103906 transitions. [2025-01-10 07:37:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58033 states and 103906 transitions. [2025-01-10 07:37:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58033 to 56396. [2025-01-10 07:37:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56396 states, 56396 states have (on average 1.8134087523937867) internal successors, (102269), 56395 states have internal predecessors, (102269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56396 states to 56396 states and 102269 transitions. [2025-01-10 07:37:13,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56396 states and 102269 transitions. [2025-01-10 07:37:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:37:13,587 INFO L432 stractBuchiCegarLoop]: Abstraction has 56396 states and 102269 transitions. [2025-01-10 07:37:13,587 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-01-10 07:37:13,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56396 states and 102269 transitions. [2025-01-10 07:37:13,752 INFO L131 ngComponentsAnalysis]: Automaton has 244 accepting balls. 16596 [2025-01-10 07:37:13,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:37:13,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:37:13,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:37:13,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:37:13,753 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume !(3 == initPersonOnFloor_~floor#1);" "assume !(4 == initPersonOnFloor_~floor#1);" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume !(3 == callOnFloor_~floorID#1);" "assume 4 == callOnFloor_~floorID#1;~calls_4~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume !(~weight~0 > ~maximumWeight~0);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;havoc timeShift__wrappee__executivefloor_~tmp~28#1;havoc timeShift__wrappee__executivefloor_~tmp___0~12#1;havoc timeShift__wrappee__executivefloor_~tmp___1~7#1;havoc timeShift__wrappee__executivefloor_~tmp___2~5#1;havoc timeShift__wrappee__executivefloor_~tmp___3~4#1;havoc timeShift__wrappee__executivefloor_~tmp___4~3#1;havoc timeShift__wrappee__executivefloor_~tmp___5~2#1;havoc timeShift__wrappee__executivefloor_~tmp___6~2#1;havoc timeShift__wrappee__executivefloor_~tmp___7~2#1;havoc timeShift__wrappee__executivefloor_~tmp___8~2#1;havoc timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :begin_inline_stopRequestedAtCurrentFloor } true;havoc stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~27#1;havoc stopRequestedAtCurrentFloor_~tmp~26#1;havoc stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedAtCurrentFloor_#t~ret88#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~26#1 := stopRequestedAtCurrentFloor_#t~ret88#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1;" "assume 0 != stopRequestedAtCurrentFloor_~tmp~26#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedAtCurrentFloor_#t~ret89#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~10#1 := stopRequestedAtCurrentFloor_#t~ret89#1;havoc stopRequestedAtCurrentFloor_#t~ret89#1;" "assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10#1);stopRequestedAtCurrentFloor_~retValue_acc~27#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1;" "timeShift__wrappee__executivefloor_#t~ret104#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret104#1;havoc timeShift__wrappee__executivefloor_#t~ret104#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume 1 == ~doorState~0;~doorState~0 := 0;" "assume { :begin_inline_stopRequestedInDirection } true;stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1 := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;stopRequestedInDirection_~dir#1 := stopRequestedInDirection_#in~dir#1;stopRequestedInDirection_~respectFloorCalls#1 := stopRequestedInDirection_#in~respectFloorCalls#1;stopRequestedInDirection_~respectInLiftCalls#1 := stopRequestedInDirection_#in~respectInLiftCalls#1;havoc stopRequestedInDirection_~retValue_acc~23#1;havoc stopRequestedInDirection_~tmp~22#1;havoc stopRequestedInDirection_~tmp___0~7#1;havoc stopRequestedInDirection_~__cil_tmp7~6#1;havoc stopRequestedInDirection_~__cil_tmp8~7#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedInDirection_#t~ret79#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~7#1 := stopRequestedInDirection_#t~ret79#1;havoc stopRequestedInDirection_#t~ret79#1;" "assume 0 != stopRequestedInDirection_~tmp___0~7#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedInDirection_#t~ret80#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~22#1 := stopRequestedInDirection_#t~ret80#1;havoc stopRequestedInDirection_#t~ret80#1;stopRequestedInDirection_~__cil_tmp7~6#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~7#1 := (if stopRequestedInDirection_~tmp~22#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23#1 := (if stopRequestedInDirection_~__cil_tmp8~7#1 == stopRequestedInDirection_~__cil_tmp7~6#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~23#1;" "timeShift__wrappee__executivefloor_#t~ret111#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;havoc stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1;assume { :end_inline_stopRequestedInDirection } true;timeShift__wrappee__executivefloor_~tmp___8~2#1 := timeShift__wrappee__executivefloor_#t~ret111#1;havoc timeShift__wrappee__executivefloor_#t~ret111#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~23#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :end_inline_timeShift__wrappee__executivefloor } true;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:37:13,753 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:37:13,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -791097416, now seen corresponding path program 1 times [2025-01-10 07:37:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:13,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484259797] [2025-01-10 07:37:13,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:37:13,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:13,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 07:37:13,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 07:37:13,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:13,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:37:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:37:13,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:37:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484259797] [2025-01-10 07:37:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484259797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:37:13,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:37:13,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:37:13,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106337911] [2025-01-10 07:37:13,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:37:13,814 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:37:13,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 12 times [2025-01-10 07:37:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840397806] [2025-01-10 07:37:13,815 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:37:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:13,823 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:13,824 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:13,824 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:37:13,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:13,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:37:13,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:13,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:13,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:13,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:13,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:37:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:37:13,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:37:13,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:37:13,844 INFO L87 Difference]: Start difference. First operand 56396 states and 102269 transitions. cyclomatic complexity: 46141 Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:37:14,143 INFO L93 Difference]: Finished difference Result 56392 states and 102243 transitions. [2025-01-10 07:37:14,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56392 states and 102243 transitions. [2025-01-10 07:37:14,587 INFO L131 ngComponentsAnalysis]: Automaton has 244 accepting balls. 16596 [2025-01-10 07:37:14,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56392 states to 56392 states and 102243 transitions. [2025-01-10 07:37:14,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55918 [2025-01-10 07:37:14,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55918 [2025-01-10 07:37:14,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56392 states and 102243 transitions. [2025-01-10 07:37:14,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:37:14,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56392 states and 102243 transitions. [2025-01-10 07:37:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56392 states and 102243 transitions. [2025-01-10 07:37:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56392 to 56392. [2025-01-10 07:37:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56392 states, 56392 states have (on average 1.8130763228826785) internal successors, (102243), 56391 states have internal predecessors, (102243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56392 states to 56392 states and 102243 transitions. [2025-01-10 07:37:15,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56392 states and 102243 transitions. [2025-01-10 07:37:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:37:15,709 INFO L432 stractBuchiCegarLoop]: Abstraction has 56392 states and 102243 transitions. [2025-01-10 07:37:15,709 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-01-10 07:37:15,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56392 states and 102243 transitions. [2025-01-10 07:37:15,884 INFO L131 ngComponentsAnalysis]: Automaton has 244 accepting balls. 16596 [2025-01-10 07:37:15,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:37:15,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:37:15,885 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:37:15,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:37:15,886 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume !(3 == callOnFloor_~floorID#1);" "assume 4 == callOnFloor_~floorID#1;~calls_4~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume !(~weight~0 > ~maximumWeight~0);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;havoc timeShift__wrappee__executivefloor_~tmp~28#1;havoc timeShift__wrappee__executivefloor_~tmp___0~12#1;havoc timeShift__wrappee__executivefloor_~tmp___1~7#1;havoc timeShift__wrappee__executivefloor_~tmp___2~5#1;havoc timeShift__wrappee__executivefloor_~tmp___3~4#1;havoc timeShift__wrappee__executivefloor_~tmp___4~3#1;havoc timeShift__wrappee__executivefloor_~tmp___5~2#1;havoc timeShift__wrappee__executivefloor_~tmp___6~2#1;havoc timeShift__wrappee__executivefloor_~tmp___7~2#1;havoc timeShift__wrappee__executivefloor_~tmp___8~2#1;havoc timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :begin_inline_stopRequestedAtCurrentFloor } true;havoc stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~27#1;havoc stopRequestedAtCurrentFloor_~tmp~26#1;havoc stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedAtCurrentFloor_#t~ret88#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~26#1 := stopRequestedAtCurrentFloor_#t~ret88#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1;" "assume 0 != stopRequestedAtCurrentFloor_~tmp~26#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedAtCurrentFloor_#t~ret89#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~10#1 := stopRequestedAtCurrentFloor_#t~ret89#1;havoc stopRequestedAtCurrentFloor_#t~ret89#1;" "assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10#1);stopRequestedAtCurrentFloor_~retValue_acc~27#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1;" "timeShift__wrappee__executivefloor_#t~ret104#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret104#1;havoc timeShift__wrappee__executivefloor_#t~ret104#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume 1 == ~doorState~0;~doorState~0 := 0;" "assume { :begin_inline_stopRequestedInDirection } true;stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1 := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;stopRequestedInDirection_~dir#1 := stopRequestedInDirection_#in~dir#1;stopRequestedInDirection_~respectFloorCalls#1 := stopRequestedInDirection_#in~respectFloorCalls#1;stopRequestedInDirection_~respectInLiftCalls#1 := stopRequestedInDirection_#in~respectInLiftCalls#1;havoc stopRequestedInDirection_~retValue_acc~23#1;havoc stopRequestedInDirection_~tmp~22#1;havoc stopRequestedInDirection_~tmp___0~7#1;havoc stopRequestedInDirection_~__cil_tmp7~6#1;havoc stopRequestedInDirection_~__cil_tmp8~7#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedInDirection_#t~ret79#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~7#1 := stopRequestedInDirection_#t~ret79#1;havoc stopRequestedInDirection_#t~ret79#1;" "assume 0 != stopRequestedInDirection_~tmp___0~7#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedInDirection_#t~ret80#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~22#1 := stopRequestedInDirection_#t~ret80#1;havoc stopRequestedInDirection_#t~ret80#1;stopRequestedInDirection_~__cil_tmp7~6#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~7#1 := (if stopRequestedInDirection_~tmp~22#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23#1 := (if stopRequestedInDirection_~__cil_tmp8~7#1 == stopRequestedInDirection_~__cil_tmp7~6#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~23#1;" "timeShift__wrappee__executivefloor_#t~ret111#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;havoc stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1;assume { :end_inline_stopRequestedInDirection } true;timeShift__wrappee__executivefloor_~tmp___8~2#1 := timeShift__wrappee__executivefloor_#t~ret111#1;havoc timeShift__wrappee__executivefloor_#t~ret111#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~23#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :end_inline_timeShift__wrappee__executivefloor } true;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:37:15,886 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:37:15,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:15,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1465801478, now seen corresponding path program 1 times [2025-01-10 07:37:15,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:15,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338782328] [2025-01-10 07:37:15,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:37:15,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:15,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 07:37:15,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 07:37:15,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:15,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:37:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:37:15,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:37:15,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338782328] [2025-01-10 07:37:15,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338782328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:37:15,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:37:15,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:37:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180923546] [2025-01-10 07:37:15,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:37:15,997 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:37:15,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 13 times [2025-01-10 07:37:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535521437] [2025-01-10 07:37:15,997 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:37:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:16,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:16,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:16,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:16,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:16,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:37:16,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:16,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:16,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:16,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:16,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:37:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:37:16,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:37:16,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:37:16,050 INFO L87 Difference]: Start difference. First operand 56392 states and 102243 transitions. cyclomatic complexity: 46119 Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:37:16,656 INFO L93 Difference]: Finished difference Result 56409 states and 102251 transitions. [2025-01-10 07:37:16,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56409 states and 102251 transitions. [2025-01-10 07:37:17,156 INFO L131 ngComponentsAnalysis]: Automaton has 244 accepting balls. 16596 [2025-01-10 07:37:17,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56409 states to 56409 states and 102251 transitions. [2025-01-10 07:37:17,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55935 [2025-01-10 07:37:17,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55935 [2025-01-10 07:37:17,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56409 states and 102251 transitions. [2025-01-10 07:37:17,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:37:17,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56409 states and 102251 transitions. [2025-01-10 07:37:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56409 states and 102251 transitions. [2025-01-10 07:37:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56409 to 56409. [2025-01-10 07:37:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56409 states, 56409 states have (on average 1.812671736779592) internal successors, (102251), 56408 states have internal predecessors, (102251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56409 states to 56409 states and 102251 transitions. [2025-01-10 07:37:18,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56409 states and 102251 transitions. [2025-01-10 07:37:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:37:18,134 INFO L432 stractBuchiCegarLoop]: Abstraction has 56409 states and 102251 transitions. [2025-01-10 07:37:18,137 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-01-10 07:37:18,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56409 states and 102251 transitions. [2025-01-10 07:37:18,474 INFO L131 ngComponentsAnalysis]: Automaton has 244 accepting balls. 16596 [2025-01-10 07:37:18,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:37:18,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:37:18,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:37:18,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:37:18,475 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume !(3 == callOnFloor_~floorID#1);" "assume 4 == callOnFloor_~floorID#1;~calls_4~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume !(~weight~0 > ~maximumWeight~0);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;havoc timeShift__wrappee__executivefloor_~tmp~28#1;havoc timeShift__wrappee__executivefloor_~tmp___0~12#1;havoc timeShift__wrappee__executivefloor_~tmp___1~7#1;havoc timeShift__wrappee__executivefloor_~tmp___2~5#1;havoc timeShift__wrappee__executivefloor_~tmp___3~4#1;havoc timeShift__wrappee__executivefloor_~tmp___4~3#1;havoc timeShift__wrappee__executivefloor_~tmp___5~2#1;havoc timeShift__wrappee__executivefloor_~tmp___6~2#1;havoc timeShift__wrappee__executivefloor_~tmp___7~2#1;havoc timeShift__wrappee__executivefloor_~tmp___8~2#1;havoc timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :begin_inline_stopRequestedAtCurrentFloor } true;havoc stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~27#1;havoc stopRequestedAtCurrentFloor_~tmp~26#1;havoc stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedAtCurrentFloor_#t~ret88#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~26#1 := stopRequestedAtCurrentFloor_#t~ret88#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1;" "assume 0 != stopRequestedAtCurrentFloor_~tmp~26#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedAtCurrentFloor_#t~ret89#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor_~tmp___0~10#1 := stopRequestedAtCurrentFloor_#t~ret89#1;havoc stopRequestedAtCurrentFloor_#t~ret89#1;" "assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~10#1);stopRequestedAtCurrentFloor_~retValue_acc~27#1 := 0;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1;" "timeShift__wrappee__executivefloor_#t~ret104#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret104#1;havoc timeShift__wrappee__executivefloor_#t~ret104#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume 1 == ~doorState~0;~doorState~0 := 0;" "assume { :begin_inline_stopRequestedInDirection } true;stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1 := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;stopRequestedInDirection_~dir#1 := stopRequestedInDirection_#in~dir#1;stopRequestedInDirection_~respectFloorCalls#1 := stopRequestedInDirection_#in~respectFloorCalls#1;stopRequestedInDirection_~respectInLiftCalls#1 := stopRequestedInDirection_#in~respectInLiftCalls#1;havoc stopRequestedInDirection_~retValue_acc~23#1;havoc stopRequestedInDirection_~tmp~22#1;havoc stopRequestedInDirection_~tmp___0~7#1;havoc stopRequestedInDirection_~__cil_tmp7~6#1;havoc stopRequestedInDirection_~__cil_tmp8~7#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedInDirection_#t~ret79#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~7#1 := stopRequestedInDirection_#t~ret79#1;havoc stopRequestedInDirection_#t~ret79#1;" "assume 0 != stopRequestedInDirection_~tmp___0~7#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedInDirection_#t~ret80#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~22#1 := stopRequestedInDirection_#t~ret80#1;havoc stopRequestedInDirection_#t~ret80#1;stopRequestedInDirection_~__cil_tmp7~6#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~7#1 := (if stopRequestedInDirection_~tmp~22#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23#1 := (if stopRequestedInDirection_~__cil_tmp8~7#1 == stopRequestedInDirection_~__cil_tmp7~6#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~23#1;" "timeShift__wrappee__executivefloor_#t~ret111#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;havoc stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1;assume { :end_inline_stopRequestedInDirection } true;timeShift__wrappee__executivefloor_~tmp___8~2#1 := timeShift__wrappee__executivefloor_#t~ret111#1;havoc timeShift__wrappee__executivefloor_#t~ret111#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~23#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :end_inline_timeShift__wrappee__executivefloor } true;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:37:18,475 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:37:18,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash 458917633, now seen corresponding path program 1 times [2025-01-10 07:37:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:18,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763653588] [2025-01-10 07:37:18,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:37:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:18,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 07:37:18,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 07:37:18,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:18,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:37:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:37:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:37:18,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763653588] [2025-01-10 07:37:18,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763653588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:37:18,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:37:18,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:37:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899550419] [2025-01-10 07:37:18,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:37:18,606 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:37:18,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:18,606 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 14 times [2025-01-10 07:37:18,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:18,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804213043] [2025-01-10 07:37:18,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:37:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:18,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:18,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:18,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:37:18,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:18,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:37:18,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:18,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:18,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:18,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:18,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:37:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:37:18,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:37:18,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:37:18,665 INFO L87 Difference]: Start difference. First operand 56409 states and 102251 transitions. cyclomatic complexity: 46110 Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:37:18,989 INFO L93 Difference]: Finished difference Result 41223 states and 74733 transitions. [2025-01-10 07:37:18,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41223 states and 74733 transitions. [2025-01-10 07:37:19,133 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 15390 [2025-01-10 07:37:19,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41223 states to 41223 states and 74733 transitions. [2025-01-10 07:37:19,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40986 [2025-01-10 07:37:19,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40986 [2025-01-10 07:37:19,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41223 states and 74733 transitions. [2025-01-10 07:37:19,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:37:19,282 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41223 states and 74733 transitions. [2025-01-10 07:37:19,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41223 states and 74733 transitions. [2025-01-10 07:37:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41223 to 41223. [2025-01-10 07:37:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41223 states, 41223 states have (on average 1.8128957135579653) internal successors, (74733), 41222 states have internal predecessors, (74733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:37:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41223 states to 41223 states and 74733 transitions. [2025-01-10 07:37:19,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41223 states and 74733 transitions. [2025-01-10 07:37:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:37:19,970 INFO L432 stractBuchiCegarLoop]: Abstraction has 41223 states and 74733 transitions. [2025-01-10 07:37:19,970 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-01-10 07:37:19,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41223 states and 74733 transitions. [2025-01-10 07:37:20,074 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 15390 [2025-01-10 07:37:20,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:37:20,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:37:20,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:37:20,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:37:20,075 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int#5(91, 17, 0, 1);call write~init~int#5(95, 17, 1, 1);call write~init~int#5(93, 17, 2, 1);call write~init~int#5(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int#6(91, 18, 0, 1);call write~init~int#6(93, 18, 1, 1);call write~init~int#6(32, 18, 2, 1);call write~init~int#6(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int#7(32, 19, 0, 1);call write~init~int#7(97, 19, 1, 1);call write~init~int#7(116, 19, 2, 1);call write~init~int#7(32, 19, 3, 1);call write~init~int#7(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int#8(37, 20, 0, 1);call write~init~int#8(105, 20, 1, 1);call write~init~int#8(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int#9(117, 22, 0, 1);call write~init~int#9(112, 22, 1, 1);call write~init~int#9(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int#10(100, 23, 0, 1);call write~init~int#10(111, 23, 1, 1);call write~init~int#10(119, 23, 2, 1);call write~init~int#10(110, 23, 3, 1);call write~init~int#10(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int#11(32, 24, 0, 1);call write~init~int#11(73, 24, 1, 1);call write~init~int#11(76, 24, 2, 1);call write~init~int#11(95, 24, 3, 1);call write~init~int#11(112, 24, 4, 1);call write~init~int#11(58, 24, 5, 1);call write~init~int#11(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int#12(32, 25, 0, 1);call write~init~int#12(37, 25, 1, 1);call write~init~int#12(105, 25, 2, 1);call write~init~int#12(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int#13(32, 26, 0, 1);call write~init~int#13(37, 26, 1, 1);call write~init~int#13(105, 26, 2, 1);call write~init~int#13(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int#14(32, 27, 0, 1);call write~init~int#14(37, 27, 1, 1);call write~init~int#14(105, 27, 2, 1);call write~init~int#14(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int#15(32, 28, 0, 1);call write~init~int#15(37, 28, 1, 1);call write~init~int#15(105, 28, 2, 1);call write~init~int#15(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int#16(32, 29, 0, 1);call write~init~int#16(37, 29, 1, 1);call write~init~int#16(105, 29, 2, 1);call write~init~int#16(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int#17(32, 30, 0, 1);call write~init~int#17(70, 30, 1, 1);call write~init~int#17(95, 30, 2, 1);call write~init~int#17(112, 30, 3, 1);call write~init~int#17(58, 30, 4, 1);call write~init~int#17(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int#18(32, 31, 0, 1);call write~init~int#18(37, 31, 1, 1);call write~init~int#18(105, 31, 2, 1);call write~init~int#18(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int#19(32, 32, 0, 1);call write~init~int#19(37, 32, 1, 1);call write~init~int#19(105, 32, 2, 1);call write~init~int#19(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int#1(32, 33, 0, 1);call write~init~int#1(37, 33, 1, 1);call write~init~int#1(105, 33, 2, 1);call write~init~int#1(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int#2(32, 34, 0, 1);call write~init~int#2(37, 34, 1, 1);call write~init~int#2(105, 34, 2, 1);call write~init~int#2(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int#3(32, 35, 0, 1);call write~init~int#3(37, 35, 1, 1);call write~init~int#3(105, 35, 2, 1);call write~init~int#3(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int#4(10, 36, 0, 1);call write~init~int#4(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~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;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1;" "main_#t~ret30#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1;" "assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "aliceCall_#t~ret19#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume !(2 == initPersonOnFloor_~floor#1);" "assume 3 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume !(2 == callOnFloor_~floorID#1);" "assume 3 == callOnFloor_~floorID#1;~calls_3~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1;" "assume !(0 == getOrigin_~person#1);" "assume !(1 == getOrigin_~person#1);" "assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1;" "angelinaCall_#t~ret20#1 := getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;havoc getOrigin_#in~person#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1;" "assume !(0 == initPersonOnFloor_~floor#1);" "assume !(1 == initPersonOnFloor_~floor#1);" "assume 2 == initPersonOnFloor_~floor#1;" "assume !(0 == initPersonOnFloor_~person#1);" "assume !(1 == initPersonOnFloor_~person#1);" "assume 2 == initPersonOnFloor_~person#1;~personOnFloor_2_2~0 := 1;" "assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1;" "assume !(0 == callOnFloor_~floorID#1);" "assume !(1 == callOnFloor_~floorID#1);" "assume 2 == callOnFloor_~floorID#1;~calls_2~0 := 1;" "havoc callOnFloor_~floorID#1;havoc callOnFloor_#in~floorID#1;assume { :end_inline_callOnFloor } true;" "havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;havoc initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1;assume { :end_inline_initPersonOnFloor } true;" "havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1;" "__utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;" "havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1;" "timeShift_#t~ret115#1 := areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1;" "assume 0 != timeShift_~tmp~29#1;" "assume !(~weight~0 > ~maximumWeight~0);~blocked~0 := 0;assume { :begin_inline_timeShift__wrappee__executivefloor } true;havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;havoc timeShift__wrappee__executivefloor_~tmp~28#1;havoc timeShift__wrappee__executivefloor_~tmp___0~12#1;havoc timeShift__wrappee__executivefloor_~tmp___1~7#1;havoc timeShift__wrappee__executivefloor_~tmp___2~5#1;havoc timeShift__wrappee__executivefloor_~tmp___3~4#1;havoc timeShift__wrappee__executivefloor_~tmp___4~3#1;havoc timeShift__wrappee__executivefloor_~tmp___5~2#1;havoc timeShift__wrappee__executivefloor_~tmp___6~2#1;havoc timeShift__wrappee__executivefloor_~tmp___7~2#1;havoc timeShift__wrappee__executivefloor_~tmp___8~2#1;havoc timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :begin_inline_stopRequestedAtCurrentFloor } true;havoc stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;havoc stopRequestedAtCurrentFloor_~retValue_acc~27#1;havoc stopRequestedAtCurrentFloor_~tmp~26#1;havoc stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedAtCurrentFloor_#t~ret88#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedAtCurrentFloor_~tmp~26#1 := stopRequestedAtCurrentFloor_#t~ret88#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1;" "assume !(0 != stopRequestedAtCurrentFloor_~tmp~26#1);assume { :begin_inline_stopRequestedAtCurrentFloor__wrappee__twothirdsfull } true;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#res#1;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret85#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret86#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret87#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~retValue_acc~26#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp~25#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp___0~9#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp4~3#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp5~4#1;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~retValue_acc~26#1;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp~25#1;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp___0~9#1;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp4~3#1;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp5~4#1;stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp4~3#1 := 2 * ~maximumWeight~0;stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp5~4#1 := (if stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp4~3#1 < 0 && 0 != stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp4~3#1 % 3 then 1 + stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp4~3#1 / 3 else stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp4~3#1 / 3);" "assume ~weight~0 > stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp5~4#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret85#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp~25#1 := stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret85#1;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret85#1;assume { :begin_inline_buttonForFloorIsPressed } true;buttonForFloorIsPressed_#in~floorID#1 := stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp~25#1;havoc buttonForFloorIsPressed_#res#1;havoc buttonForFloorIsPressed_~floorID#1, buttonForFloorIsPressed_~retValue_acc~16#1;buttonForFloorIsPressed_~floorID#1 := buttonForFloorIsPressed_#in~floorID#1;havoc buttonForFloorIsPressed_~retValue_acc~16#1;" "assume 0 == buttonForFloorIsPressed_~floorID#1;buttonForFloorIsPressed_~retValue_acc~16#1 := ~floorButtons_0~0;buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~16#1;" "stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret86#1 := buttonForFloorIsPressed_#res#1;havoc buttonForFloorIsPressed_~floorID#1, buttonForFloorIsPressed_~retValue_acc~16#1;havoc buttonForFloorIsPressed_#in~floorID#1;assume { :end_inline_buttonForFloorIsPressed } true;stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp___0~9#1 := stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret86#1;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret86#1;stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~retValue_acc~26#1 := (if 1 == stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp___0~9#1 then 1 else 0);stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#res#1 := stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~retValue_acc~26#1;" "stopRequestedAtCurrentFloor_#t~ret91#1 := stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#res#1;havoc stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret85#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret86#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_#t~ret87#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~retValue_acc~26#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp~25#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~tmp___0~9#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp4~3#1, stopRequestedAtCurrentFloor__wrappee__twothirdsfull_~__cil_tmp5~4#1;assume { :end_inline_stopRequestedAtCurrentFloor__wrappee__twothirdsfull } true;stopRequestedAtCurrentFloor_~retValue_acc~27#1 := stopRequestedAtCurrentFloor_#t~ret91#1;havoc stopRequestedAtCurrentFloor_#t~ret91#1;stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1;" "timeShift__wrappee__executivefloor_#t~ret104#1 := stopRequestedAtCurrentFloor_#res#1;havoc stopRequestedAtCurrentFloor_#t~ret88#1, stopRequestedAtCurrentFloor_#t~ret89#1, stopRequestedAtCurrentFloor_#t~ret90#1, stopRequestedAtCurrentFloor_#t~ret91#1, stopRequestedAtCurrentFloor_~retValue_acc~27#1, stopRequestedAtCurrentFloor_~tmp~26#1, stopRequestedAtCurrentFloor_~tmp___0~10#1;assume { :end_inline_stopRequestedAtCurrentFloor } true;timeShift__wrappee__executivefloor_~tmp___9~2#1 := timeShift__wrappee__executivefloor_#t~ret104#1;havoc timeShift__wrappee__executivefloor_#t~ret104#1;" "assume !(0 != timeShift__wrappee__executivefloor_~tmp___9~2#1);" "assume 1 == ~doorState~0;~doorState~0 := 0;" "assume { :begin_inline_stopRequestedInDirection } true;stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1 := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;stopRequestedInDirection_~dir#1 := stopRequestedInDirection_#in~dir#1;stopRequestedInDirection_~respectFloorCalls#1 := stopRequestedInDirection_#in~respectFloorCalls#1;stopRequestedInDirection_~respectInLiftCalls#1 := stopRequestedInDirection_#in~respectInLiftCalls#1;havoc stopRequestedInDirection_~retValue_acc~23#1;havoc stopRequestedInDirection_~tmp~22#1;havoc stopRequestedInDirection_~tmp___0~7#1;havoc stopRequestedInDirection_~__cil_tmp7~6#1;havoc stopRequestedInDirection_~__cil_tmp8~7#1;assume { :begin_inline_isExecutiveFloorCalling } true;havoc isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;havoc isExecutiveFloorCalling_~retValue_acc~30#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := ~executiveFloor~0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~2#1;" "assume !(0 == isFloorCalling_~floorID#1);" "assume !(1 == isFloorCalling_~floorID#1);" "assume !(2 == isFloorCalling_~floorID#1);" "assume !(3 == isFloorCalling_~floorID#1);" "assume 4 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~2#1 := ~calls_4~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~2#1;" "isExecutiveFloorCalling_#t~ret144#1 := isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~2#1;havoc isFloorCalling_#in~floorID#1;assume { :end_inline_isFloorCalling } true;isExecutiveFloorCalling_~retValue_acc~30#1 := isExecutiveFloorCalling_#t~ret144#1;havoc isExecutiveFloorCalling_#t~ret144#1;isExecutiveFloorCalling_#res#1 := isExecutiveFloorCalling_~retValue_acc~30#1;" "stopRequestedInDirection_#t~ret79#1 := isExecutiveFloorCalling_#res#1;havoc isExecutiveFloorCalling_#t~ret144#1, isExecutiveFloorCalling_~retValue_acc~30#1;assume { :end_inline_isExecutiveFloorCalling } true;stopRequestedInDirection_~tmp___0~7#1 := stopRequestedInDirection_#t~ret79#1;havoc stopRequestedInDirection_#t~ret79#1;" "assume 0 != stopRequestedInDirection_~tmp___0~7#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;havoc getCurrentFloorID_~retValue_acc~14#1;getCurrentFloorID_~retValue_acc~14#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1;" "stopRequestedInDirection_#t~ret80#1 := getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~14#1;assume { :end_inline_getCurrentFloorID } true;stopRequestedInDirection_~tmp~22#1 := stopRequestedInDirection_#t~ret80#1;havoc stopRequestedInDirection_#t~ret80#1;stopRequestedInDirection_~__cil_tmp7~6#1 := (if 1 == stopRequestedInDirection_~dir#1 then 1 else 0);stopRequestedInDirection_~__cil_tmp8~7#1 := (if stopRequestedInDirection_~tmp~22#1 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~23#1 := (if stopRequestedInDirection_~__cil_tmp8~7#1 == stopRequestedInDirection_~__cil_tmp7~6#1 then 1 else 0);stopRequestedInDirection_#res#1 := stopRequestedInDirection_~retValue_acc~23#1;" "timeShift__wrappee__executivefloor_#t~ret111#1 := stopRequestedInDirection_#res#1;havoc stopRequestedInDirection_#t~ret79#1, stopRequestedInDirection_#t~ret80#1, stopRequestedInDirection_#t~ret81#1, stopRequestedInDirection_~dir#1, stopRequestedInDirection_~respectFloorCalls#1, stopRequestedInDirection_~respectInLiftCalls#1, stopRequestedInDirection_~retValue_acc~23#1, stopRequestedInDirection_~tmp~22#1, stopRequestedInDirection_~tmp___0~7#1, stopRequestedInDirection_~__cil_tmp7~6#1, stopRequestedInDirection_~__cil_tmp8~7#1;havoc stopRequestedInDirection_#in~dir#1, stopRequestedInDirection_#in~respectFloorCalls#1, stopRequestedInDirection_#in~respectInLiftCalls#1;assume { :end_inline_stopRequestedInDirection } true;timeShift__wrappee__executivefloor_~tmp___8~2#1 := timeShift__wrappee__executivefloor_#t~ret111#1;havoc timeShift__wrappee__executivefloor_#t~ret111#1;" "assume 0 != timeShift__wrappee__executivefloor_~tmp___8~2#1;assume { :begin_inline_continueInDirection } true;continueInDirection_#in~dir#1 := ~currentHeading~0;havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;continueInDirection_~dir#1 := continueInDirection_#in~dir#1;havoc continueInDirection_~tmp~23#1;~currentHeading~0 := continueInDirection_~dir#1;" "assume !(1 == ~currentHeading~0);" "assume !(0 == ~currentFloorID~0);" "assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1;" "havoc continueInDirection_#t~ret82#1, continueInDirection_~dir#1, continueInDirection_~tmp~23#1;havoc continueInDirection_#in~dir#1;assume { :end_inline_continueInDirection } true;" "havoc timeShift__wrappee__executivefloor_#t~ret104#1, timeShift__wrappee__executivefloor_#t~ret105#1, timeShift__wrappee__executivefloor_#t~ret106#1, timeShift__wrappee__executivefloor_#t~ret107#1, timeShift__wrappee__executivefloor_#t~ret108#1, timeShift__wrappee__executivefloor_#t~ret109#1, timeShift__wrappee__executivefloor_#t~ret110#1, timeShift__wrappee__executivefloor_#t~ret111#1, timeShift__wrappee__executivefloor_#t~ret112#1, timeShift__wrappee__executivefloor_#t~ret113#1, timeShift__wrappee__executivefloor_#t~ret114#1, timeShift__wrappee__executivefloor_~tmp~28#1, timeShift__wrappee__executivefloor_~tmp___0~12#1, timeShift__wrappee__executivefloor_~tmp___1~7#1, timeShift__wrappee__executivefloor_~tmp___2~5#1, timeShift__wrappee__executivefloor_~tmp___3~4#1, timeShift__wrappee__executivefloor_~tmp___4~3#1, timeShift__wrappee__executivefloor_~tmp___5~2#1, timeShift__wrappee__executivefloor_~tmp___6~2#1, timeShift__wrappee__executivefloor_~tmp___7~2#1, timeShift__wrappee__executivefloor_~tmp___8~2#1, timeShift__wrappee__executivefloor_~tmp___9~2#1;assume { :end_inline_timeShift__wrappee__executivefloor } true;" "assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3);" "assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;" "assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1;" "assume !(1 == existInLiftCallsInDirection_~d#1);" "assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1;" [2025-01-10 07:37:20,076 INFO L754 eck$LassoCheckResult]: Loop: "assume existInLiftCallsInDirection_~i___0~0#1 >= 0;" "existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0;" "assume !(existInLiftCallsInDirection_~i___0~0#1 < 5);" "existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1;" [2025-01-10 07:37:20,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash -932339432, now seen corresponding path program 1 times [2025-01-10 07:37:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:20,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267702566] [2025-01-10 07:37:20,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:37:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:20,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 07:37:20,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 07:37:20,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:20,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:37:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:37:20,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:37:20,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267702566] [2025-01-10 07:37:20,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267702566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:37:20,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:37:20,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:37:20,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495559629] [2025-01-10 07:37:20,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:37:20,154 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:37:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:37:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 529489122, now seen corresponding path program 15 times [2025-01-10 07:37:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:37:20,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394062266] [2025-01-10 07:37:20,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:37:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:37:20,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:20,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:20,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:37:20,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:20,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:37:20,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:37:20,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:37:20,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:37:20,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:37:20,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:37:20,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:37:20,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:37:20,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:37:20,185 INFO L87 Difference]: Start difference. First operand 41223 states and 74733 transitions. cyclomatic complexity: 33678 Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)