./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:51:40,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:51:40,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:51:40,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:51:40,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:51:40,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:51:40,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:51:40,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:51:40,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:51:40,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:51:40,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:51:40,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:51:40,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:51:40,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:51:40,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:51:40,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:51:40,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:51:40,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:51:40,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:51:40,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:51:40,299 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:51:40,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:51:40,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:51:40,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:51:40,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:51:40,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:51:40,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:51:40,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:51:40,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:51:40,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:51:40,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:51:40,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:51:40,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:51:40,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:51:40,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:51:40,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:51:40,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:51:40,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:51:40,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:51:40,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:51:40,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:51:40,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:51:40,317 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:51:40,338 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:51:40,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:51:40,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:51:40,339 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:51:40,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:51:40,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:51:40,340 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:51:40,340 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:51:40,341 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:51:40,341 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:51:40,341 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:51:40,342 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:51:40,342 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:51:40,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:51:40,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:51:40,342 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:51:40,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:51:40,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:51:40,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:51:40,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:51:40,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:51:40,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:51:40,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:51:40,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:51:40,344 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:51:40,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:51:40,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:51:40,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:51:40,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:51:40,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:51:40,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:51:40,346 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:51:40,346 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 [2022-07-14 15:51:40,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:51:40,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:51:40,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:51:40,581 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:51:40,582 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:51:40,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2022-07-14 15:51:40,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4493091d/ed28440535de4083a2ddc84bab231e74/FLAGc40414108 [2022-07-14 15:51:41,054 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:51:41,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2022-07-14 15:51:41,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4493091d/ed28440535de4083a2ddc84bab231e74/FLAGc40414108 [2022-07-14 15:51:41,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4493091d/ed28440535de4083a2ddc84bab231e74 [2022-07-14 15:51:41,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:51:41,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:51:41,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:51:41,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:51:41,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:51:41,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:41,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fac640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41, skipping insertion in model container [2022-07-14 15:51:41,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:41,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:51:41,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:51:41,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2022-07-14 15:51:41,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:51:41,500 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:51:41,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2022-07-14 15:51:41,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:51:41,597 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:51:41,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41 WrapperNode [2022-07-14 15:51:41,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:51:41,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:51:41,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:51:41,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:51:41,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:41,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:41,797 INFO L137 Inliner]: procedures = 93, calls = 337, calls flagged for inlining = 189, calls inlined = 556, statements flattened = 17245 [2022-07-14 15:51:41,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:51:41,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:51:41,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:51:41,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:51:41,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:41,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:41,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:41,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:41,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:42,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:42,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:42,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:51:42,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:51:42,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:51:42,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:51:42,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (1/1) ... [2022-07-14 15:51:42,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:51:42,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:51:42,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:51:42,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 15:51:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:51:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:51:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:51:42,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:51:42,270 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:51:42,284 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:51:47,068 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:51:47,151 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:51:47,152 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 15:51:47,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:51:47 BoogieIcfgContainer [2022-07-14 15:51:47,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:51:47,160 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:51:47,160 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:51:47,163 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:51:47,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:51:47,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:51:41" (1/3) ... [2022-07-14 15:51:47,164 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1937d422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:51:47, skipping insertion in model container [2022-07-14 15:51:47,164 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:51:47,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:51:41" (2/3) ... [2022-07-14 15:51:47,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1937d422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:51:47, skipping insertion in model container [2022-07-14 15:51:47,165 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:51:47,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:51:47" (3/3) ... [2022-07-14 15:51:47,166 INFO L354 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2022-07-14 15:51:47,256 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:51:47,256 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:51:47,256 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:51:47,256 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:51:47,257 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:51:47,257 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:51:47,257 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:51:47,257 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:51:47,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4989 states, 4988 states have (on average 1.8700882117080995) internal successors, (9328), 4988 states have internal predecessors, (9328), 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) [2022-07-14 15:51:47,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2478 [2022-07-14 15:51:47,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:51:47,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:51:47,377 INFO L179 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] [2022-07-14 15:51:47,378 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:51:47,378 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:51:47,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4989 states, 4988 states have (on average 1.8700882117080995) internal successors, (9328), 4988 states have internal predecessors, (9328), 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) [2022-07-14 15:51:47,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2478 [2022-07-14 15:51:47,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:51:47,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:51:47,440 INFO L179 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] [2022-07-14 15:51:47,440 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:51:47,448 INFO L752 eck$LassoCheckResult]: Stem: 3125#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 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(91, 17, 0, 1);call write~init~int(95, 17, 1, 1);call write~init~int(93, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(91, 18, 0, 1);call write~init~int(93, 18, 1, 1);call write~init~int(32, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int(32, 19, 0, 1);call write~init~int(97, 19, 1, 1);call write~init~int(116, 19, 2, 1);call write~init~int(32, 19, 3, 1);call write~init~int(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int(37, 20, 0, 1);call write~init~int(105, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int(117, 22, 0, 1);call write~init~int(112, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int(100, 23, 0, 1);call write~init~int(111, 23, 1, 1);call write~init~int(119, 23, 2, 1);call write~init~int(110, 23, 3, 1);call write~init~int(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int(32, 24, 0, 1);call write~init~int(73, 24, 1, 1);call write~init~int(76, 24, 2, 1);call write~init~int(95, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int(32, 25, 0, 1);call write~init~int(37, 25, 1, 1);call write~init~int(105, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int(32, 26, 0, 1);call write~init~int(37, 26, 1, 1);call write~init~int(105, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int(32, 27, 0, 1);call write~init~int(37, 27, 1, 1);call write~init~int(105, 27, 2, 1);call write~init~int(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int(32, 28, 0, 1);call write~init~int(37, 28, 1, 1);call write~init~int(105, 28, 2, 1);call write~init~int(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int(32, 29, 0, 1);call write~init~int(37, 29, 1, 1);call write~init~int(105, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int(32, 30, 0, 1);call write~init~int(70, 30, 1, 1);call write~init~int(95, 30, 2, 1);call write~init~int(112, 30, 3, 1);call write~init~int(58, 30, 4, 1);call write~init~int(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int(32, 31, 0, 1);call write~init~int(37, 31, 1, 1);call write~init~int(105, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int(32, 32, 0, 1);call write~init~int(37, 32, 1, 1);call write~init~int(105, 32, 2, 1);call write~init~int(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int(32, 33, 0, 1);call write~init~int(37, 33, 1, 1);call write~init~int(105, 33, 2, 1);call write~init~int(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int(32, 34, 0, 1);call write~init~int(37, 34, 1, 1);call write~init~int(105, 34, 2, 1);call write~init~int(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int(32, 35, 0, 1);call write~init~int(37, 35, 1, 1);call write~init~int(105, 35, 2, 1);call write~init~int(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int(10, 36, 0, 1);call write~init~int(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~cleanupTimeShifts~0 := 12; 4881#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret118#1, main_~retValue_acc~20#1, main_~tmp~25#1;havoc main_~retValue_acc~20#1;havoc main_~tmp~25#1;assume { :begin_inline_select_helpers } true; 980#L3259true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 4198#L3252true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~22#1;havoc valid_product_~retValue_acc~22#1;valid_product_~retValue_acc~22#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~22#1; 2415#L3267true main_#t~ret118#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~25#1 := main_#t~ret118#1;havoc main_#t~ret118#1; 1916#L3132true assume 0 != main_~tmp~25#1;assume { :begin_inline_setup } true; 4815#L3104true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification9_spec__1 } true;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 3255#L450true assume { :end_inline___utac_acc__Specification9_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret111#1, bigMacCall_~tmp~22#1;havoc bigMacCall_~tmp~22#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 5;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~24#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~24#1; 633#L3315true assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~24#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~24#1; 2207#L3340true bigMacCall_#t~ret111#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~22#1 := bigMacCall_#t~ret111#1;havoc bigMacCall_#t~ret111#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 5, bigMacCall_~tmp~22#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 2153#L2483true assume 0 == initPersonOnFloor_~floor#1; 4624#L2484true assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 3468#L2591-1true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 1735#L2275true assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 1924#L2287-2true assume { :end_inline_callOnFloor } true; 284#L2627true assume { :end_inline_initPersonOnFloor } true; 1297#L2909true assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret112#1, cleanup_#t~ret113#1, cleanup_~i~1#1, cleanup_~tmp~23#1, cleanup_~tmp___0~7#1, cleanup_~__cil_tmp4~2#1;havoc cleanup_~i~1#1;havoc cleanup_~tmp~23#1;havoc cleanup_~tmp___0~7#1;havoc cleanup_~__cil_tmp4~2#1;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret76#1, timeShift_~tmp~14#1;havoc timeShift_~tmp~14#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 2662#L864true timeShift_#t~ret76#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~14#1 := timeShift_#t~ret76#1;havoc timeShift_#t~ret76#1; 2981#L1746true assume 0 != timeShift_~tmp~14#1; 3766#L1747true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 989#L1746-1true assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret27#1, __utac_acc__Specification9_spec__3_#t~ret28#1, __utac_acc__Specification9_spec__3_#t~ret29#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~3#1, __utac_acc__Specification9_spec__3_~tmp___0~0#1, __utac_acc__Specification9_spec__3_~tmp___1~0#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~3#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~0#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~0#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1; 4061#L855true __utac_acc__Specification9_spec__3_#t~ret27#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3#1 := __utac_acc__Specification9_spec__3_#t~ret27#1;havoc __utac_acc__Specification9_spec__3_#t~ret27#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~3#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~8#1;havoc isEmpty_~retValue_acc~8#1; 3978#L915-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~8#1; 2237#L947-12true __utac_acc__Specification9_spec__3_#t~ret28#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0#1 := __utac_acc__Specification9_spec__3_#t~ret28#1;havoc __utac_acc__Specification9_spec__3_#t~ret28#1; 3005#L493true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0#1;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 236#L503-1true assume { :end_inline___utac_acc__Specification9_spec__3 } true; 1299#L1764true assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 0; 4276#L2936-2true [2022-07-14 15:51:47,449 INFO L754 eck$LassoCheckResult]: Loop: 4276#L2936-2true assume !false; 382#L2937true cleanup_~__cil_tmp4~2#1 := ~cleanupTimeShifts~0 - 1; 1498#L2940true assume cleanup_~i~1#1 < cleanup_~__cil_tmp4~2#1;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res#1;havoc isBlocked_~retValue_acc~3#1;havoc isBlocked_~retValue_acc~3#1;isBlocked_~retValue_acc~3#1 := ~blocked~0;isBlocked_#res#1 := isBlocked_~retValue_acc~3#1; 1972#L678true cleanup_#t~ret112#1 := isBlocked_#res#1;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~7#1 := cleanup_#t~ret112#1;havoc cleanup_#t~ret112#1; 3303#L2944true assume 1 != cleanup_~tmp___0~7#1; 711#L2944-1true assume { :begin_inline_isIdle } true;havoc isIdle_#res#1;havoc isIdle_#t~ret38#1, isIdle_~retValue_acc~10#1, isIdle_~tmp~8#1;havoc isIdle_~retValue_acc~10#1;havoc isIdle_~tmp~8#1;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res#1;havoc anyStopRequested_#t~ret33#1, anyStopRequested_#t~ret34#1, anyStopRequested_#t~ret35#1, anyStopRequested_#t~ret36#1, anyStopRequested_#t~ret37#1, anyStopRequested_~retValue_acc~9#1, anyStopRequested_~tmp~7#1, anyStopRequested_~tmp___0~1#1, anyStopRequested_~tmp___1~1#1, anyStopRequested_~tmp___2~0#1, anyStopRequested_~tmp___3~0#1;havoc anyStopRequested_~retValue_acc~9#1;havoc anyStopRequested_~tmp~7#1;havoc anyStopRequested_~tmp___0~1#1;havoc anyStopRequested_~tmp___1~1#1;havoc anyStopRequested_~tmp___2~0#1;havoc anyStopRequested_~tmp___3~0#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := 0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~16#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~16#1; 3211#L2212-42true assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~16#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~16#1; 1889#L2239-42true anyStopRequested_#t~ret33#1 := isFloorCalling_#res#1;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~0#1 := anyStopRequested_#t~ret33#1;havoc anyStopRequested_#t~ret33#1; 2156#L963true assume 0 != anyStopRequested_~tmp___3~0#1;anyStopRequested_~retValue_acc~9#1 := 1;anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~9#1; 4357#L1027true isIdle_#t~ret38#1 := anyStopRequested_#res#1;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~8#1 := isIdle_#t~ret38#1;havoc isIdle_#t~ret38#1;isIdle_~retValue_acc~10#1 := (if 0 == isIdle_~tmp~8#1 then 1 else 0);isIdle_#res#1 := isIdle_~retValue_acc~10#1; 351#L1040true cleanup_#t~ret113#1 := isIdle_#res#1;assume { :end_inline_isIdle } true;cleanup_~tmp~23#1 := cleanup_#t~ret113#1;havoc cleanup_#t~ret113#1; 4587#L2956true assume !(0 != cleanup_~tmp~23#1);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret76#1, timeShift_~tmp~14#1;havoc timeShift_~tmp~14#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 366#L864-2true timeShift_#t~ret76#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~14#1 := timeShift_#t~ret76#1;havoc timeShift_#t~ret76#1; 4052#L1746-2true assume 0 != timeShift_~tmp~14#1; 1379#L1747-3true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1530#L1746-3true assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret27#1, __utac_acc__Specification9_spec__3_#t~ret28#1, __utac_acc__Specification9_spec__3_#t~ret29#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~3#1, __utac_acc__Specification9_spec__3_~tmp___0~0#1, __utac_acc__Specification9_spec__3_~tmp___1~0#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~3#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~0#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~0#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1; 4839#L855-1true __utac_acc__Specification9_spec__3_#t~ret27#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3#1 := __utac_acc__Specification9_spec__3_#t~ret27#1;havoc __utac_acc__Specification9_spec__3_#t~ret27#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~3#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~8#1;havoc isEmpty_~retValue_acc~8#1; 1995#L915-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~8#1; 293#L947-25true __utac_acc__Specification9_spec__3_#t~ret28#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0#1 := __utac_acc__Specification9_spec__3_#t~ret28#1;havoc __utac_acc__Specification9_spec__3_#t~ret28#1; 1781#L493-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0#1;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 4320#L503-3true assume { :end_inline___utac_acc__Specification9_spec__3 } true; 607#L1764-1true assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 1 + cleanup_~i~1#1; 4276#L2936-2true [2022-07-14 15:51:47,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:51:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1748420846, now seen corresponding path program 1 times [2022-07-14 15:51:47,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:51:47,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433273314] [2022-07-14 15:51:47,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:51:47,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:51:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:51:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:51:47,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:51:47,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433273314] [2022-07-14 15:51:47,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433273314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:51:47,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:51:47,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:51:47,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30327245] [2022-07-14 15:51:47,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:51:47,671 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:51:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:51:47,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2026705950, now seen corresponding path program 1 times [2022-07-14 15:51:47,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:51:47,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343479290] [2022-07-14 15:51:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:51:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:51:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:51:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:51:47,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:51:47,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343479290] [2022-07-14 15:51:47,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343479290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:51:47,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:51:47,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:51:47,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078407181] [2022-07-14 15:51:47,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:51:47,704 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:51:47,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:51:47,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:51:47,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:51:47,746 INFO L87 Difference]: Start difference. First operand has 4989 states, 4988 states have (on average 1.8700882117080995) internal successors, (9328), 4988 states have internal predecessors, (9328), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-07-14 15:51:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:51:48,623 INFO L93 Difference]: Finished difference Result 13294 states and 24822 transitions. [2022-07-14 15:51:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:51:48,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13294 states and 24822 transitions. [2022-07-14 15:51:48,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9034 [2022-07-14 15:51:48,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13294 states to 13240 states and 24761 transitions. [2022-07-14 15:51:48,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13240 [2022-07-14 15:51:48,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13240 [2022-07-14 15:51:48,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13240 states and 24761 transitions. [2022-07-14 15:51:48,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:51:48,820 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13240 states and 24761 transitions. [2022-07-14 15:51:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13240 states and 24761 transitions. [2022-07-14 15:51:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13240 to 4970. [2022-07-14 15:51:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4970 states, 4970 states have (on average 1.87102615694165) internal successors, (9299), 4969 states have internal predecessors, (9299), 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) [2022-07-14 15:51:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 9299 transitions. [2022-07-14 15:51:48,979 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4970 states and 9299 transitions. [2022-07-14 15:51:48,979 INFO L374 stractBuchiCegarLoop]: Abstraction has 4970 states and 9299 transitions. [2022-07-14 15:51:48,979 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:51:48,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4970 states and 9299 transitions. [2022-07-14 15:51:48,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2480 [2022-07-14 15:51:48,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:51:48,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:51:48,998 INFO L179 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] [2022-07-14 15:51:48,998 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:51:48,999 INFO L752 eck$LassoCheckResult]: Stem: 22658#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 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(91, 17, 0, 1);call write~init~int(95, 17, 1, 1);call write~init~int(93, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(91, 18, 0, 1);call write~init~int(93, 18, 1, 1);call write~init~int(32, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int(32, 19, 0, 1);call write~init~int(97, 19, 1, 1);call write~init~int(116, 19, 2, 1);call write~init~int(32, 19, 3, 1);call write~init~int(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int(37, 20, 0, 1);call write~init~int(105, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int(117, 22, 0, 1);call write~init~int(112, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int(100, 23, 0, 1);call write~init~int(111, 23, 1, 1);call write~init~int(119, 23, 2, 1);call write~init~int(110, 23, 3, 1);call write~init~int(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int(32, 24, 0, 1);call write~init~int(73, 24, 1, 1);call write~init~int(76, 24, 2, 1);call write~init~int(95, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int(32, 25, 0, 1);call write~init~int(37, 25, 1, 1);call write~init~int(105, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int(32, 26, 0, 1);call write~init~int(37, 26, 1, 1);call write~init~int(105, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int(32, 27, 0, 1);call write~init~int(37, 27, 1, 1);call write~init~int(105, 27, 2, 1);call write~init~int(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int(32, 28, 0, 1);call write~init~int(37, 28, 1, 1);call write~init~int(105, 28, 2, 1);call write~init~int(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int(32, 29, 0, 1);call write~init~int(37, 29, 1, 1);call write~init~int(105, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int(32, 30, 0, 1);call write~init~int(70, 30, 1, 1);call write~init~int(95, 30, 2, 1);call write~init~int(112, 30, 3, 1);call write~init~int(58, 30, 4, 1);call write~init~int(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int(32, 31, 0, 1);call write~init~int(37, 31, 1, 1);call write~init~int(105, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int(32, 32, 0, 1);call write~init~int(37, 32, 1, 1);call write~init~int(105, 32, 2, 1);call write~init~int(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int(32, 33, 0, 1);call write~init~int(37, 33, 1, 1);call write~init~int(105, 33, 2, 1);call write~init~int(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int(32, 34, 0, 1);call write~init~int(37, 34, 1, 1);call write~init~int(105, 34, 2, 1);call write~init~int(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int(32, 35, 0, 1);call write~init~int(37, 35, 1, 1);call write~init~int(105, 35, 2, 1);call write~init~int(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int(10, 36, 0, 1);call write~init~int(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~cleanupTimeShifts~0 := 12; 22659#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret118#1, main_~retValue_acc~20#1, main_~tmp~25#1;havoc main_~retValue_acc~20#1;havoc main_~tmp~25#1;assume { :begin_inline_select_helpers } true; 20292#L3259 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 20293#L3252 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~22#1;havoc valid_product_~retValue_acc~22#1;valid_product_~retValue_acc~22#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~22#1; 22105#L3267 main_#t~ret118#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~25#1 := main_#t~ret118#1;havoc main_#t~ret118#1; 21572#L3132 assume 0 != main_~tmp~25#1;assume { :begin_inline_setup } true; 21573#L3104 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification9_spec__1 } true;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 22741#L450 assume { :end_inline___utac_acc__Specification9_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret111#1, bigMacCall_~tmp~22#1;havoc bigMacCall_~tmp~22#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 5;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~24#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~24#1; 19694#L3315 assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~24#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~24#1; 18672#L3340 bigMacCall_#t~ret111#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~22#1 := bigMacCall_#t~ret111#1;havoc bigMacCall_#t~ret111#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 5, bigMacCall_~tmp~22#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 21852#L2483 assume 0 == initPersonOnFloor_~floor#1; 21853#L2484 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 18754#L2591-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 21345#L2275 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 18746#L2287-2 assume { :end_inline_callOnFloor } true; 18979#L2627 assume { :end_inline_initPersonOnFloor } true; 18980#L2909 assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret112#1, cleanup_#t~ret113#1, cleanup_~i~1#1, cleanup_~tmp~23#1, cleanup_~tmp___0~7#1, cleanup_~__cil_tmp4~2#1;havoc cleanup_~i~1#1;havoc cleanup_~tmp~23#1;havoc cleanup_~tmp___0~7#1;havoc cleanup_~__cil_tmp4~2#1;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret76#1, timeShift_~tmp~14#1;havoc timeShift_~tmp~14#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 20782#L864 timeShift_#t~ret76#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~14#1 := timeShift_#t~ret76#1;havoc timeShift_#t~ret76#1; 22318#L1746 assume 0 != timeShift_~tmp~14#1; 22556#L1747 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 20306#L1746-1 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret27#1, __utac_acc__Specification9_spec__3_#t~ret28#1, __utac_acc__Specification9_spec__3_#t~ret29#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~3#1, __utac_acc__Specification9_spec__3_~tmp___0~0#1, __utac_acc__Specification9_spec__3_~tmp___1~0#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~3#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~0#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~0#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1; 20307#L855 __utac_acc__Specification9_spec__3_#t~ret27#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3#1 := __utac_acc__Specification9_spec__3_#t~ret27#1;havoc __utac_acc__Specification9_spec__3_#t~ret27#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~3#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~8#1;havoc isEmpty_~retValue_acc~8#1; 23087#L915-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~8#1; 18430#L947-12 __utac_acc__Specification9_spec__3_#t~ret28#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0#1 := __utac_acc__Specification9_spec__3_#t~ret28#1;havoc __utac_acc__Specification9_spec__3_#t~ret28#1; 22572#L493 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0#1);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 22573#L864-1 __utac_acc__Specification9_spec__3_#t~ret29#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~0#1 := __utac_acc__Specification9_spec__3_#t~ret29#1;havoc __utac_acc__Specification9_spec__3_#t~ret29#1; 23027#L503 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0#1); 18876#L503-1 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 18877#L1764 assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 0; 19642#L2936-2 [2022-07-14 15:51:48,999 INFO L754 eck$LassoCheckResult]: Loop: 19642#L2936-2 assume !false; 19187#L2937 cleanup_~__cil_tmp4~2#1 := ~cleanupTimeShifts~0 - 1; 19188#L2940 assume cleanup_~i~1#1 < cleanup_~__cil_tmp4~2#1;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res#1;havoc isBlocked_~retValue_acc~3#1;havoc isBlocked_~retValue_acc~3#1;isBlocked_~retValue_acc~3#1 := ~blocked~0;isBlocked_#res#1 := isBlocked_~retValue_acc~3#1; 21044#L678 cleanup_#t~ret112#1 := isBlocked_#res#1;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~7#1 := cleanup_#t~ret112#1;havoc cleanup_#t~ret112#1; 21639#L2944 assume 1 != cleanup_~tmp___0~7#1; 19836#L2944-1 assume { :begin_inline_isIdle } true;havoc isIdle_#res#1;havoc isIdle_#t~ret38#1, isIdle_~retValue_acc~10#1, isIdle_~tmp~8#1;havoc isIdle_~retValue_acc~10#1;havoc isIdle_~tmp~8#1;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res#1;havoc anyStopRequested_#t~ret33#1, anyStopRequested_#t~ret34#1, anyStopRequested_#t~ret35#1, anyStopRequested_#t~ret36#1, anyStopRequested_#t~ret37#1, anyStopRequested_~retValue_acc~9#1, anyStopRequested_~tmp~7#1, anyStopRequested_~tmp___0~1#1, anyStopRequested_~tmp___1~1#1, anyStopRequested_~tmp___2~0#1, anyStopRequested_~tmp___3~0#1;havoc anyStopRequested_~retValue_acc~9#1;havoc anyStopRequested_~tmp~7#1;havoc anyStopRequested_~tmp___0~1#1;havoc anyStopRequested_~tmp___1~1#1;havoc anyStopRequested_~tmp___2~0#1;havoc anyStopRequested_~tmp___3~0#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := 0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~16#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~16#1; 19837#L2212-42 assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~16#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~16#1; 18959#L2239-42 anyStopRequested_#t~ret33#1 := isFloorCalling_#res#1;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~0#1 := anyStopRequested_#t~ret33#1;havoc anyStopRequested_#t~ret33#1; 21546#L963 assume 0 != anyStopRequested_~tmp___3~0#1;anyStopRequested_~retValue_acc~9#1 := 1;anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~9#1; 19444#L1027 isIdle_#t~ret38#1 := anyStopRequested_#res#1;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~8#1 := isIdle_#t~ret38#1;havoc isIdle_#t~ret38#1;isIdle_~retValue_acc~10#1 := (if 0 == isIdle_~tmp~8#1 then 1 else 0);isIdle_#res#1 := isIdle_~retValue_acc~10#1; 19125#L1040 cleanup_#t~ret113#1 := isIdle_#res#1;assume { :end_inline_isIdle } true;cleanup_~tmp~23#1 := cleanup_#t~ret113#1;havoc cleanup_#t~ret113#1; 19126#L2956 assume !(0 != cleanup_~tmp~23#1);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret76#1, timeShift_~tmp~14#1;havoc timeShift_~tmp~14#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 19151#L864-2 timeShift_#t~ret76#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~14#1 := timeShift_#t~ret76#1;havoc timeShift_#t~ret76#1; 19152#L1746-2 assume 0 != timeShift_~tmp~14#1; 20897#L1747-3 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 19688#L1746-3 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret27#1, __utac_acc__Specification9_spec__3_#t~ret28#1, __utac_acc__Specification9_spec__3_#t~ret29#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~3#1, __utac_acc__Specification9_spec__3_~tmp___0~0#1, __utac_acc__Specification9_spec__3_~tmp___1~0#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~3#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~0#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~0#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1; 21077#L855-1 __utac_acc__Specification9_spec__3_#t~ret27#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3#1 := __utac_acc__Specification9_spec__3_#t~ret27#1;havoc __utac_acc__Specification9_spec__3_#t~ret27#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~3#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~8#1;havoc isEmpty_~retValue_acc~8#1; 21664#L915-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~8#1; 20287#L947-25 __utac_acc__Specification9_spec__3_#t~ret28#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0#1 := __utac_acc__Specification9_spec__3_#t~ret28#1;havoc __utac_acc__Specification9_spec__3_#t~ret28#1; 21406#L493-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0#1);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 20542#L864-3 __utac_acc__Specification9_spec__3_#t~ret29#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~0#1 := __utac_acc__Specification9_spec__3_#t~ret29#1;havoc __utac_acc__Specification9_spec__3_#t~ret29#1; 20543#L503-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0#1); 19574#L503-3 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 19641#L1764-1 assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 1 + cleanup_~i~1#1; 19642#L2936-2 [2022-07-14 15:51:48,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:51:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash 900412753, now seen corresponding path program 1 times [2022-07-14 15:51:49,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:51:49,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070602758] [2022-07-14 15:51:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:51:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:51:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:51:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:51:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:51:49,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070602758] [2022-07-14 15:51:49,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070602758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:51:49,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:51:49,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:51:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972947430] [2022-07-14 15:51:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:51:49,072 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:51:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:51:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2044800129, now seen corresponding path program 1 times [2022-07-14 15:51:49,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:51:49,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890200239] [2022-07-14 15:51:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:51:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:51:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:51:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:51:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:51:49,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890200239] [2022-07-14 15:51:49,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890200239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:51:49,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:51:49,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 15:51:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242724216] [2022-07-14 15:51:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:51:49,122 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:51:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:51:49,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:51:49,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:51:49,123 INFO L87 Difference]: Start difference. First operand 4970 states and 9299 transitions. cyclomatic complexity: 4330 Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-07-14 15:51:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:51:49,761 INFO L93 Difference]: Finished difference Result 8171 states and 15171 transitions. [2022-07-14 15:51:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 15:51:49,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8171 states and 15171 transitions. [2022-07-14 15:51:49,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6545 [2022-07-14 15:51:49,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8171 states to 8171 states and 15171 transitions. [2022-07-14 15:51:49,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8171 [2022-07-14 15:51:49,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8171 [2022-07-14 15:51:49,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8171 states and 15171 transitions. [2022-07-14 15:51:49,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:51:49,890 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8171 states and 15171 transitions. [2022-07-14 15:51:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states and 15171 transitions. [2022-07-14 15:51:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 4425. [2022-07-14 15:51:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 4425 states have (on average 1.8653107344632769) internal successors, (8254), 4424 states have internal predecessors, (8254), 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) [2022-07-14 15:51:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 8254 transitions. [2022-07-14 15:51:50,005 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4425 states and 8254 transitions. [2022-07-14 15:51:50,006 INFO L374 stractBuchiCegarLoop]: Abstraction has 4425 states and 8254 transitions. [2022-07-14 15:51:50,006 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:51:50,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4425 states and 8254 transitions. [2022-07-14 15:51:50,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2834 [2022-07-14 15:51:50,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:51:50,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:51:50,030 INFO L179 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] [2022-07-14 15:51:50,030 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:51:50,031 INFO L752 eck$LassoCheckResult]: Stem: 34868#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 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(91, 17, 0, 1);call write~init~int(95, 17, 1, 1);call write~init~int(93, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(4, 18);call write~init~int(91, 18, 0, 1);call write~init~int(93, 18, 1, 1);call write~init~int(32, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(5, 19);call write~init~int(32, 19, 0, 1);call write~init~int(97, 19, 1, 1);call write~init~int(116, 19, 2, 1);call write~init~int(32, 19, 3, 1);call write~init~int(0, 19, 4, 1);call #Ultimate.allocInit(3, 20);call write~init~int(37, 20, 0, 1);call write~init~int(105, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(10, 21);call #Ultimate.allocInit(3, 22);call write~init~int(117, 22, 0, 1);call write~init~int(112, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(5, 23);call write~init~int(100, 23, 0, 1);call write~init~int(111, 23, 1, 1);call write~init~int(119, 23, 2, 1);call write~init~int(110, 23, 3, 1);call write~init~int(0, 23, 4, 1);call #Ultimate.allocInit(7, 24);call write~init~int(32, 24, 0, 1);call write~init~int(73, 24, 1, 1);call write~init~int(76, 24, 2, 1);call write~init~int(95, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(4, 25);call write~init~int(32, 25, 0, 1);call write~init~int(37, 25, 1, 1);call write~init~int(105, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(4, 26);call write~init~int(32, 26, 0, 1);call write~init~int(37, 26, 1, 1);call write~init~int(105, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(4, 27);call write~init~int(32, 27, 0, 1);call write~init~int(37, 27, 1, 1);call write~init~int(105, 27, 2, 1);call write~init~int(0, 27, 3, 1);call #Ultimate.allocInit(4, 28);call write~init~int(32, 28, 0, 1);call write~init~int(37, 28, 1, 1);call write~init~int(105, 28, 2, 1);call write~init~int(0, 28, 3, 1);call #Ultimate.allocInit(4, 29);call write~init~int(32, 29, 0, 1);call write~init~int(37, 29, 1, 1);call write~init~int(105, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(6, 30);call write~init~int(32, 30, 0, 1);call write~init~int(70, 30, 1, 1);call write~init~int(95, 30, 2, 1);call write~init~int(112, 30, 3, 1);call write~init~int(58, 30, 4, 1);call write~init~int(0, 30, 5, 1);call #Ultimate.allocInit(4, 31);call write~init~int(32, 31, 0, 1);call write~init~int(37, 31, 1, 1);call write~init~int(105, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(4, 32);call write~init~int(32, 32, 0, 1);call write~init~int(37, 32, 1, 1);call write~init~int(105, 32, 2, 1);call write~init~int(0, 32, 3, 1);call #Ultimate.allocInit(4, 33);call write~init~int(32, 33, 0, 1);call write~init~int(37, 33, 1, 1);call write~init~int(105, 33, 2, 1);call write~init~int(0, 33, 3, 1);call #Ultimate.allocInit(4, 34);call write~init~int(32, 34, 0, 1);call write~init~int(37, 34, 1, 1);call write~init~int(105, 34, 2, 1);call write~init~int(0, 34, 3, 1);call #Ultimate.allocInit(4, 35);call write~init~int(32, 35, 0, 1);call write~init~int(37, 35, 1, 1);call write~init~int(105, 35, 2, 1);call write~init~int(0, 35, 3, 1);call #Ultimate.allocInit(2, 36);call write~init~int(10, 36, 0, 1);call write~init~int(0, 36, 1, 1);call #Ultimate.allocInit(9, 37);~head~0.base, ~head~0.offset := 0, 0;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~cleanupTimeShifts~0 := 12; 34869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret118#1, main_~retValue_acc~20#1, main_~tmp~25#1;havoc main_~retValue_acc~20#1;havoc main_~tmp~25#1;assume { :begin_inline_select_helpers } true; 33024#L3259 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 33025#L3252 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~22#1;havoc valid_product_~retValue_acc~22#1;valid_product_~retValue_acc~22#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~22#1; 34434#L3267 main_#t~ret118#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~25#1 := main_#t~ret118#1;havoc main_#t~ret118#1; 34007#L3132 assume 0 != main_~tmp~25#1;assume { :begin_inline_setup } true; 34008#L3104 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification9_spec__1 } true;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 34935#L450 assume { :end_inline___utac_acc__Specification9_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret111#1, bigMacCall_~tmp~22#1;havoc bigMacCall_~tmp~22#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 5;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~24#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~24#1; 32559#L3315 assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~24#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~24#1; 31768#L3340 bigMacCall_#t~ret111#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~22#1 := bigMacCall_#t~ret111#1;havoc bigMacCall_#t~ret111#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 5, bigMacCall_~tmp~22#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 34234#L2483 assume 0 == initPersonOnFloor_~floor#1; 34235#L2484 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 31835#L2591-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 33832#L2275 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 31827#L2287-2 assume { :end_inline_callOnFloor } true; 32009#L2627 assume { :end_inline_initPersonOnFloor } true; 32010#L2909 assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret112#1, cleanup_#t~ret113#1, cleanup_~i~1#1, cleanup_~tmp~23#1, cleanup_~tmp___0~7#1, cleanup_~__cil_tmp4~2#1;havoc cleanup_~i~1#1;havoc cleanup_~tmp~23#1;havoc cleanup_~tmp___0~7#1;havoc cleanup_~__cil_tmp4~2#1;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret76#1, timeShift_~tmp~14#1;havoc timeShift_~tmp~14#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 33405#L864 timeShift_#t~ret76#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~14#1 := timeShift_#t~ret76#1;havoc timeShift_#t~ret76#1; 34604#L1746 assume 0 != timeShift_~tmp~14#1; 34780#L1747 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 33035#L1746-1 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret27#1, __utac_acc__Specification9_spec__3_#t~ret28#1, __utac_acc__Specification9_spec__3_#t~ret29#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~3#1, __utac_acc__Specification9_spec__3_~tmp___0~0#1, __utac_acc__Specification9_spec__3_~tmp___1~0#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~3#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~0#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~0#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1; 33036#L855 __utac_acc__Specification9_spec__3_#t~ret27#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3#1 := __utac_acc__Specification9_spec__3_#t~ret27#1;havoc __utac_acc__Specification9_spec__3_#t~ret27#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~3#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~8#1;havoc isEmpty_~retValue_acc~8#1; 35228#L915-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~8#1; 31591#L947-12 __utac_acc__Specification9_spec__3_#t~ret28#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0#1 := __utac_acc__Specification9_spec__3_#t~ret28#1;havoc __utac_acc__Specification9_spec__3_#t~ret28#1; 34792#L493 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0#1);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 34793#L864-1 __utac_acc__Specification9_spec__3_#t~ret29#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~0#1 := __utac_acc__Specification9_spec__3_#t~ret29#1;havoc __utac_acc__Specification9_spec__3_#t~ret29#1; 35165#L503 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0#1; 35306#L504 assume 0 == __utac_acc__Specification9_spec__3_~floor~0#1; 33849#L505 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 31928#L503-1 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 31929#L1764 assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 0; 32521#L2936-2 [2022-07-14 15:51:50,031 INFO L754 eck$LassoCheckResult]: Loop: 32521#L2936-2 assume !false; 32182#L2937 cleanup_~__cil_tmp4~2#1 := ~cleanupTimeShifts~0 - 1; 32183#L2940 assume cleanup_~i~1#1 < cleanup_~__cil_tmp4~2#1;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res#1;havoc isBlocked_~retValue_acc~3#1;havoc isBlocked_~retValue_acc~3#1;isBlocked_~retValue_acc~3#1 := ~blocked~0;isBlocked_#res#1 := isBlocked_~retValue_acc~3#1; 33594#L678 cleanup_#t~ret112#1 := isBlocked_#res#1;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~7#1 := cleanup_#t~ret112#1;havoc cleanup_#t~ret112#1; 34057#L2944 assume 1 != cleanup_~tmp___0~7#1; 32672#L2944-1 assume { :begin_inline_isIdle } true;havoc isIdle_#res#1;havoc isIdle_#t~ret38#1, isIdle_~retValue_acc~10#1, isIdle_~tmp~8#1;havoc isIdle_~retValue_acc~10#1;havoc isIdle_~tmp~8#1;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res#1;havoc anyStopRequested_#t~ret33#1, anyStopRequested_#t~ret34#1, anyStopRequested_#t~ret35#1, anyStopRequested_#t~ret36#1, anyStopRequested_#t~ret37#1, anyStopRequested_~retValue_acc~9#1, anyStopRequested_~tmp~7#1, anyStopRequested_~tmp___0~1#1, anyStopRequested_~tmp___1~1#1, anyStopRequested_~tmp___2~0#1, anyStopRequested_~tmp___3~0#1;havoc anyStopRequested_~retValue_acc~9#1;havoc anyStopRequested_~tmp~7#1;havoc anyStopRequested_~tmp___0~1#1;havoc anyStopRequested_~tmp___1~1#1;havoc anyStopRequested_~tmp___2~0#1;havoc anyStopRequested_~tmp___3~0#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := 0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~16#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~16#1; 32673#L2212-42 assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~16#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~16#1; 31997#L2239-42 anyStopRequested_#t~ret33#1 := isFloorCalling_#res#1;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~0#1 := anyStopRequested_#t~ret33#1;havoc anyStopRequested_#t~ret33#1; 33987#L963 assume 0 != anyStopRequested_~tmp___3~0#1;anyStopRequested_~retValue_acc~9#1 := 1;anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~9#1; 35416#L1027 isIdle_#t~ret38#1 := anyStopRequested_#res#1;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~8#1 := isIdle_#t~ret38#1;havoc isIdle_#t~ret38#1;isIdle_~retValue_acc~10#1 := (if 0 == isIdle_~tmp~8#1 then 1 else 0);isIdle_#res#1 := isIdle_~retValue_acc~10#1; 35415#L1040 cleanup_#t~ret113#1 := isIdle_#res#1;assume { :end_inline_isIdle } true;cleanup_~tmp~23#1 := cleanup_#t~ret113#1;havoc cleanup_#t~ret113#1; 35372#L2956 assume !(0 != cleanup_~tmp~23#1);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret76#1, timeShift_~tmp~14#1;havoc timeShift_~tmp~14#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 32153#L864-2 timeShift_#t~ret76#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~14#1 := timeShift_#t~ret76#1;havoc timeShift_#t~ret76#1; 32154#L1746-2 assume 0 != timeShift_~tmp~14#1; 33492#L1747-3 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 32555#L1746-3 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret27#1, __utac_acc__Specification9_spec__3_#t~ret28#1, __utac_acc__Specification9_spec__3_#t~ret29#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~3#1, __utac_acc__Specification9_spec__3_~tmp___0~0#1, __utac_acc__Specification9_spec__3_~tmp___1~0#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~3#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~0#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~0#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~4#1;havoc getCurrentFloorID_~retValue_acc~4#1;getCurrentFloorID_~retValue_acc~4#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1; 33619#L855-1 __utac_acc__Specification9_spec__3_#t~ret27#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~3#1 := __utac_acc__Specification9_spec__3_#t~ret27#1;havoc __utac_acc__Specification9_spec__3_#t~ret27#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~3#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~8#1;havoc isEmpty_~retValue_acc~8#1; 34075#L915-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~8#1; 32023#L947-25 __utac_acc__Specification9_spec__3_#t~ret28#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~0#1 := __utac_acc__Specification9_spec__3_#t~ret28#1;havoc __utac_acc__Specification9_spec__3_#t~ret28#1; 32024#L493-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0#1);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~5#1;havoc areDoorsOpen_~retValue_acc~5#1;areDoorsOpen_~retValue_acc~5#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~5#1; 33880#L864-3 __utac_acc__Specification9_spec__3_#t~ret29#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~0#1 := __utac_acc__Specification9_spec__3_#t~ret29#1;havoc __utac_acc__Specification9_spec__3_#t~ret29#1; 35364#L503-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0#1; 35345#L504-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0#1; 32467#L505-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 32468#L503-3 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 32520#L1764-1 assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 1 + cleanup_~i~1#1; 32521#L2936-2 [2022-07-14 15:51:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:51:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1949441206, now seen corresponding path program 1 times [2022-07-14 15:51:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:51:50,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954142100] [2022-07-14 15:51:50,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:51:50,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:51:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:51:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:51:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:51:50,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954142100] [2022-07-14 15:51:50,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954142100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:51:50,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:51:50,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:51:50,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726938245] [2022-07-14 15:51:50,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:51:50,065 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:51:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:51:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2100510746, now seen corresponding path program 1 times [2022-07-14 15:51:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:51:50,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327899321] [2022-07-14 15:51:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:51:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:51:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:51:50,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:51:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:51:50,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:51:50,535 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:51:50,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:51:50,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:51:50,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:51:50,536 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:51:50,537 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:51:50,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:51:50,537 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:51:50,537 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product26.cil.c_Iteration3_Loop [2022-07-14 15:51:50,537 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:51:50,538 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:51:50,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:50,998 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:51:50,999 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:51:51,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:51:51,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:51:51,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:51:51,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 15:51:51,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:51:51,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:51:51,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-14 15:51:51,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:51:51,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:51:51,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:51:51,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 15:51:51,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:51:51,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:51:51,670 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:51:51,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-14 15:51:51,673 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:51:51,673 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:51:51,673 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:51:51,673 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:51:51,673 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:51:51,673 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:51:51,673 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:51:51,673 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:51:51,673 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product26.cil.c_Iteration3_Loop [2022-07-14 15:51:51,674 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:51:51,674 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:51:51,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:51,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:51:52,062 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:51:52,065 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:51:52,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:51:52,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:51:52,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:51:52,082 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 [2022-07-14 15:51:52,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:51:52,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:51:52,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:51:52,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:51:52,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:51:52,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:51:52,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:51:52,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 15:51:52,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:51:52,130 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-14 15:51:52,130 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 15:51:52,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:51:52,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:51:52,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:51:52,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 15:51:52,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:51:52,142 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 15:51:52,143 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:51:52,143 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1#1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1#1 Supporting invariants [] [2022-07-14 15:51:52,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 15:51:52,181 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 15:51:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:51:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:51:52,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:51:52,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:51:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:51:52,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:51:52,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:51:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:51:52,478 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-14 15:51:52,478 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4425 states and 8254 transitions. cyclomatic complexity: 3830 Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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) [2022-07-14 15:51:52,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 15:51:52,778 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4425 states and 8254 transitions. cyclomatic complexity: 3830. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 7259 states and 13543 transitions. Complement of second has 8 states. [2022-07-14 15:51:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-14 15:51:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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) [2022-07-14 15:51:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7041 transitions. [2022-07-14 15:51:52,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7041 transitions. Stem has 31 letters. Loop has 26 letters. [2022-07-14 15:51:52,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:51:52,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7041 transitions. Stem has 57 letters. Loop has 26 letters. [2022-07-14 15:51:52,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:51:52,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7041 transitions. Stem has 31 letters. Loop has 52 letters. [2022-07-14 15:51:52,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:51:52,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7259 states and 13543 transitions. [2022-07-14 15:51:52,825 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:51:52,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7259 states to 0 states and 0 transitions. [2022-07-14 15:51:52,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:51:52,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:51:52,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:51:52,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:51:52,826 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:51:52,826 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:51:52,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:51:52,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:51:52,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:51:52,827 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-07-14 15:51:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:51:52,827 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-14 15:51:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 15:51:52,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-14 15:51:52,828 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:51:52,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 15:51:52,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:51:52,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:51:52,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:51:52,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:51:52,829 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:51:52,829 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:51:52,829 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:51:52,829 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:51:52,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:51:52,829 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:51:52,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:51:52,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:51:52 BoogieIcfgContainer [2022-07-14 15:51:52,834 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:51:52,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:51:52,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:51:52,835 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:51:52,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:51:47" (3/4) ... [2022-07-14 15:51:52,837 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:51:52,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:51:52,838 INFO L158 Benchmark]: Toolchain (without parser) took 11750.94ms. Allocated memory was 98.6MB in the beginning and 891.3MB in the end (delta: 792.7MB). Free memory was 57.6MB in the beginning and 606.4MB in the end (delta: -548.8MB). Peak memory consumption was 242.2MB. Max. memory is 16.1GB. [2022-07-14 15:51:52,838 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory was 77.1MB in the beginning and 77.1MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:51:52,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.49ms. Allocated memory is still 98.6MB. Free memory was 57.4MB in the beginning and 46.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-07-14 15:51:52,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 199.14ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 46.3MB in the beginning and 65.5MB in the end (delta: -19.1MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2022-07-14 15:51:52,839 INFO L158 Benchmark]: Boogie Preprocessor took 296.50ms. Allocated memory is still 127.9MB. Free memory was 65.5MB in the beginning and 59.9MB in the end (delta: 5.6MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2022-07-14 15:51:52,840 INFO L158 Benchmark]: RCFGBuilder took 5063.57ms. Allocated memory was 127.9MB in the beginning and 453.0MB in the end (delta: 325.1MB). Free memory was 59.5MB in the beginning and 345.4MB in the end (delta: -285.9MB). Peak memory consumption was 211.6MB. Max. memory is 16.1GB. [2022-07-14 15:51:52,840 INFO L158 Benchmark]: BuchiAutomizer took 5674.14ms. Allocated memory was 453.0MB in the beginning and 891.3MB in the end (delta: 438.3MB). Free memory was 345.4MB in the beginning and 606.4MB in the end (delta: -261.0MB). Peak memory consumption was 176.3MB. Max. memory is 16.1GB. [2022-07-14 15:51:52,840 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 891.3MB. Free memory is still 606.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:51:52,842 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory was 77.1MB in the beginning and 77.1MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.49ms. Allocated memory is still 98.6MB. Free memory was 57.4MB in the beginning and 46.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 199.14ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 46.3MB in the beginning and 65.5MB in the end (delta: -19.1MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 296.50ms. Allocated memory is still 127.9MB. Free memory was 65.5MB in the beginning and 59.9MB in the end (delta: 5.6MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * RCFGBuilder took 5063.57ms. Allocated memory was 127.9MB in the beginning and 453.0MB in the end (delta: 325.1MB). Free memory was 59.5MB in the beginning and 345.4MB in the end (delta: -285.9MB). Peak memory consumption was 211.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5674.14ms. Allocated memory was 453.0MB in the beginning and 891.3MB in the end (delta: 438.3MB). Free memory was 345.4MB in the beginning and 606.4MB in the end (delta: -261.0MB). Peak memory consumption was 176.3MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 891.3MB. Free memory is still 606.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 12016 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59040 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59039 mSDsluCounter, 100546 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69737 mSDsCounter, 284 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 284 mSolverCounterUnsat, 30809 mSDtfsCounter, 267 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 76ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 15:51:52,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE