./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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_spec13_product32.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 e7c9485412041f5ced738777edbcc586e5ce326d6f265b136a50fe41e5db19fb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:01:50,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:01:50,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:01:50,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:01:50,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:01:50,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:01:50,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:01:50,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:01:50,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:01:50,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:01:50,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:01:50,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:01:50,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:01:50,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:01:50,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:01:50,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:01:50,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:01:50,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:01:50,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:01:50,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:01:50,199 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:01:50,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:01:50,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:01:50,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:01:50,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:01:50,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:01:50,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:01:50,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:01:50,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:01:50,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:01:50,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:01:50,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:01:50,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:01:50,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:01:50,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:01:50,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:01:50,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:01:50,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:01:50,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:01:50,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:01:50,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:01:50,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:01:50,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:01:50,243 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:01:50,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:01:50,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:01:50,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:01:50,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:01:50,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:01:50,245 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:01:50,245 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:01:50,245 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:01:50,246 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:01:50,246 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:01:50,246 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:01:50,246 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:01:50,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:01:50,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:01:50,247 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:01:50,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:01:50,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:01:50,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:01:50,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:01:50,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:01:50,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:01:50,249 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:01:50,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:01:50,249 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:01:50,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:01:50,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:01:50,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:01:50,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:01:50,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:01:50,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:01:50,251 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:01:50,251 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 -> e7c9485412041f5ced738777edbcc586e5ce326d6f265b136a50fe41e5db19fb [2022-07-13 04:01:50,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:01:50,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:01:50,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:01:50,473 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:01:50,474 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:01:50,475 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c [2022-07-13 04:01:50,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4441560f/a84a4426bb884be8985ac3ae5b19dc42/FLAG9e55543e2 [2022-07-13 04:01:50,970 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:01:50,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec13_product32.cil.c [2022-07-13 04:01:50,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4441560f/a84a4426bb884be8985ac3ae5b19dc42/FLAG9e55543e2 [2022-07-13 04:01:51,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4441560f/a84a4426bb884be8985ac3ae5b19dc42 [2022-07-13 04:01:51,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:01:51,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:01:51,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:01:51,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:01:51,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:01:51,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:51,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8122fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51, skipping insertion in model container [2022-07-13 04:01:51,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:51,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:01:51,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:01:51,254 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_spec13_product32.cil.c[1546,1559] [2022-07-13 04:01:51,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:01:51,556 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:01:51,564 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_spec13_product32.cil.c[1546,1559] [2022-07-13 04:01:51,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:01:51,649 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:01:51,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51 WrapperNode [2022-07-13 04:01:51,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:01:51,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:01:51,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:01:51,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:01:51,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:51,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:52,192 INFO L137 Inliner]: procedures = 97, calls = 354, calls flagged for inlining = 206, calls inlined = 2055, statements flattened = 69864 [2022-07-13 04:01:52,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:01:52,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:01:52,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:01:52,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:01:52,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:52,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:52,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:52,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:52,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:53,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:53,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:53,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:01:53,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:01:53,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:01:53,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:01:53,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (1/1) ... [2022-07-13 04:01:53,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:01:53,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:01:53,423 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-13 04:01:53,424 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-13 04:01:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:01:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:01:53,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:01:53,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:01:53,641 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:01:53,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:02:08,533 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:02:08,623 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:02:08,626 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2022-07-13 04:02:08,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:02:08 BoogieIcfgContainer [2022-07-13 04:02:08,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:02:08,643 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:02:08,643 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:02:08,649 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:02:08,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:02:08,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:01:51" (1/3) ... [2022-07-13 04:02:08,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6db315aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:02:08, skipping insertion in model container [2022-07-13 04:02:08,650 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:02:08,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:01:51" (2/3) ... [2022-07-13 04:02:08,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6db315aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:02:08, skipping insertion in model container [2022-07-13 04:02:08,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:02:08,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:02:08" (3/3) ... [2022-07-13 04:02:08,652 INFO L354 chiAutomizerObserver]: Analyzing ICFG elevator_spec13_product32.cil.c [2022-07-13 04:02:08,987 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:02:08,988 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:02:08,988 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:02:08,988 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:02:08,988 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:02:08,988 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:02:08,988 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:02:08,988 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:02:09,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18482 states, 18481 states have (on average 1.8746279963205454) internal successors, (34645), 18481 states have internal predecessors, (34645), 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-13 04:02:09,273 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2022-07-13 04:02:09,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:02:09,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:02:09,281 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, 1, 1, 1] [2022-07-13 04:02:09,281 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:02:09,281 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:02:09,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18482 states, 18481 states have (on average 1.8746279963205454) internal successors, (34645), 18481 states have internal predecessors, (34645), 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-13 04:02:09,468 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2022-07-13 04:02:09,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:02:09,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:02:09,471 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, 1, 1, 1] [2022-07-13 04:02:09,471 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:02:09,480 INFO L752 eck$LassoCheckResult]: Stem: 7528#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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int(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);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 4610#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 3816#L1414true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 11720#L1407true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 2841#L1422true main_#t~ret30#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 3984#L591true assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 14600#L564true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 6776#L1317true assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 11787#L1342true aliceCall_#t~ret19#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 13493#L964true assume 0 == initPersonOnFloor_~floor#1; 17883#L965true assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 383#L1072-1true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 13214#L756true assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 11191#L768-2true assume { :end_inline_callOnFloor } true; 11975#L1108true assume { :end_inline_initPersonOnFloor } true; 940#L324true assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 14637#L1317-1true assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 17106#L1342-1true angelinaCall_#t~ret20#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 819#L964-1true assume 0 == initPersonOnFloor_~floor#1; 6158#L965-2true assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 5684#L1072-3true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 10078#L756-2true assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 6977#L768-5true assume { :end_inline_callOnFloor } true; 5142#L1108-1true assume { :end_inline_initPersonOnFloor } true; 4457#L335true assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 15888#L2092true __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 4947#L170true assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 9011#L2049true timeShift_#t~ret115#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 976#L3060true assume 0 != timeShift_~tmp~29#1; 9958#L3061true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 9243#L3060-1true assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 17947#L188true assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 7632#L189true assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 2913#L3280true assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0; 15183#L3284-2true [2022-07-13 04:02:09,480 INFO L754 eck$LassoCheckResult]: Loop: 15183#L3284-2true assume !false; 3442#L3285true assume existInLiftCallsInDirection_~i~3#1 < 5; 5592#L3286true assume !(0 == existInLiftCallsInDirection_~i~3#1); 11227#L3299true assume !(1 == existInLiftCallsInDirection_~i~3#1); 11513#L3308true assume !(2 == existInLiftCallsInDirection_~i~3#1); 17187#L3317true assume !(3 == existInLiftCallsInDirection_~i~3#1); 15229#L3326true assume !(4 == existInLiftCallsInDirection_~i~3#1); 3541#L3327-1true existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1; 15183#L3284-2true [2022-07-13 04:02:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1516016117, now seen corresponding path program 1 times [2022-07-13 04:02:09,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:09,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244617014] [2022-07-13 04:02:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:09,718 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-13 04:02:09,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:02:09,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244617014] [2022-07-13 04:02:09,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244617014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:02:09,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:02:09,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:02:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825816232] [2022-07-13 04:02:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:02:09,724 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:02:09,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1774605181, now seen corresponding path program 1 times [2022-07-13 04:02:09,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:09,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339818074] [2022-07-13 04:02:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:09,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:02:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:09,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:02:09,792 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:02:09,793 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:02:09,793 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:02:09,793 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:02:09,793 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:02:09,794 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:09,794 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:02:09,794 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:02:09,794 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration1_Loop [2022-07-13 04:02:09,794 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:02:09,794 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:02:09,806 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-13 04:02:09,862 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:02:09,862 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:02:09,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:09,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:09,882 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-13 04:02:09,907 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-13 04:02:09,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:02:09,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:02:09,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 04:02:09,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:09,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:09,953 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-13 04:02:09,955 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-13 04:02:09,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:02:09,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:02:09,984 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:02:09,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 04:02:09,987 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:02:09,987 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:02:09,987 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:02:09,987 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:02:09,987 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:02:09,987 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:09,987 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:02:09,987 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:02:09,987 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration1_Loop [2022-07-13 04:02:09,987 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:02:09,987 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:02:09,988 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-13 04:02:10,033 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:02:10,036 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:02:10,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:10,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:10,039 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-13 04:02:10,046 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-13 04:02:10,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:02:10,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:02:10,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:02:10,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:02:10,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:02:10,054 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-13 04:02:10,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:02:10,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:02:10,067 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:02:10,072 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:02:10,073 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 04:02:10,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:10,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:10,087 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-13 04:02:10,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:02:10,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:02:10,116 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:02:10,117 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 Supporting invariants [] [2022-07-13 04:02:10,121 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-13 04:02:10,134 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-13 04:02:10,137 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:02:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:10,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:02:10,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:02:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:10,282 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 04:02:10,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:02:10,427 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-13 04:02:10,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-13 04:02:10,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18482 states, 18481 states have (on average 1.8746279963205454) internal successors, (34645), 18481 states have internal predecessors, (34645), 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 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-13 04:02:12,958 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-13 04:02:17,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18482 states, 18481 states have (on average 1.8746279963205454) internal successors, (34645), 18481 states have internal predecessors, (34645), 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 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 217756 states and 408017 transitions. Complement of second has 18 states. [2022-07-13 04:02:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2022-07-13 04:02:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-13 04:02:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 221339 transitions. [2022-07-13 04:02:18,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 221339 transitions. Stem has 34 letters. Loop has 8 letters. [2022-07-13 04:02:18,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:02:18,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 221339 transitions. Stem has 42 letters. Loop has 8 letters. [2022-07-13 04:02:18,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:02:18,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 221339 transitions. Stem has 34 letters. Loop has 16 letters. [2022-07-13 04:02:18,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:02:18,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217756 states and 408017 transitions. [2022-07-13 04:02:19,582 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 29608 [2022-07-13 04:02:20,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217756 states to 118005 states and 221062 transitions. [2022-07-13 04:02:20,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117975 [2022-07-13 04:02:20,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117976 [2022-07-13 04:02:20,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118005 states and 221062 transitions. [2022-07-13 04:02:20,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:02:20,302 INFO L369 hiAutomatonCegarLoop]: Abstraction has 118005 states and 221062 transitions. [2022-07-13 04:02:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118005 states and 221062 transitions. [2022-07-13 04:02:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118005 to 33236. [2022-07-13 04:02:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33236 states, 33236 states have (on average 1.87089300758214) internal successors, (62181), 33235 states have internal predecessors, (62181), 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-13 04:02:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33236 states to 33236 states and 62181 transitions. [2022-07-13 04:02:21,593 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33236 states and 62181 transitions. [2022-07-13 04:02:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:02:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:02:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:02:21,597 INFO L87 Difference]: Start difference. First operand 33236 states and 62181 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:02:22,519 INFO L93 Difference]: Finished difference Result 48015 states and 89681 transitions. [2022-07-13 04:02:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:02:22,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48015 states and 89681 transitions. [2022-07-13 04:02:22,697 INFO L131 ngComponentsAnalysis]: Automaton has 78 accepting balls. 15906 [2022-07-13 04:02:23,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48015 states to 48002 states and 89668 transitions. [2022-07-13 04:02:23,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47983 [2022-07-13 04:02:23,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47983 [2022-07-13 04:02:23,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48002 states and 89668 transitions. [2022-07-13 04:02:23,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:02:23,142 INFO L369 hiAutomatonCegarLoop]: Abstraction has 48002 states and 89668 transitions. [2022-07-13 04:02:23,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48002 states and 89668 transitions. [2022-07-13 04:02:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48002 to 18479. [2022-07-13 04:02:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18479 states, 18479 states have (on average 1.8680123383299962) internal successors, (34519), 18478 states have internal predecessors, (34519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18479 states to 18479 states and 34519 transitions. [2022-07-13 04:02:23,529 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18479 states and 34519 transitions. [2022-07-13 04:02:23,529 INFO L374 stractBuchiCegarLoop]: Abstraction has 18479 states and 34519 transitions. [2022-07-13 04:02:23,529 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:02:23,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18479 states and 34519 transitions. [2022-07-13 04:02:23,575 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2022-07-13 04:02:23,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:02:23,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:02:23,578 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, 1, 1, 1, 1, 1, 1] [2022-07-13 04:02:23,578 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:02:23,578 INFO L752 eck$LassoCheckResult]: Stem: 330483#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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int(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);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 326737#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 325481#L1414 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 325482#L1407 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 323816#L1422 main_#t~ret30#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 323817#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 325738#L564 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 329637#L1317 assume !(0 == getOrigin_~person#1); 329084#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 326601#L1342 aliceCall_#t~ret19#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 334062#L964 assume 0 == initPersonOnFloor_~floor#1; 335052#L965 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 318688#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 318689#L756 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 319028#L768-2 assume { :end_inline_callOnFloor } true; 333682#L1108 assume { :end_inline_initPersonOnFloor } true; 320034#L324 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 320035#L1317-1 assume !(0 == getOrigin_~person#1); 329474#L1321-1 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 327874#L1342-1 angelinaCall_#t~ret20#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 319754#L964-1 assume 0 == initPersonOnFloor_~floor#1; 319755#L965-2 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 317670#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 328238#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 324861#L768-5 assume { :end_inline_callOnFloor } true; 327499#L1108-1 assume { :end_inline_initPersonOnFloor } true; 326470#L335 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 326471#L2092 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 327216#L170 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 327217#L2049 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 320114#L3060 assume 0 != timeShift_~tmp~29#1; 320116#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 332144#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 332145#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 330594#L189 assume !(1 == ~prevDir~0); 330595#L215 assume 0 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 1;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 321489#L3280-2 assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0; 321491#L3284-8 [2022-07-13 04:02:23,579 INFO L754 eck$LassoCheckResult]: Loop: 321491#L3284-8 assume !false; 329684#L3285-2 assume existInLiftCallsInDirection_~i~3#1 < 5; 329685#L3286-2 assume !(0 == existInLiftCallsInDirection_~i~3#1); 325502#L3299-2 assume !(1 == existInLiftCallsInDirection_~i~3#1); 319392#L3308-2 assume !(2 == existInLiftCallsInDirection_~i~3#1); 326695#L3317-2 assume !(3 == existInLiftCallsInDirection_~i~3#1); 324038#L3326-2 assume !(4 == existInLiftCallsInDirection_~i~3#1); 335397#L3327-5 existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1; 321491#L3284-8 [2022-07-13 04:02:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1974373456, now seen corresponding path program 1 times [2022-07-13 04:02:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:23,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618787377] [2022-07-13 04:02:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:23,641 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-13 04:02:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:02:23,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618787377] [2022-07-13 04:02:23,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618787377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:02:23,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:02:23,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:02:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955050587] [2022-07-13 04:02:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:02:23,644 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:02:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash -443123075, now seen corresponding path program 1 times [2022-07-13 04:02:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:23,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837081591] [2022-07-13 04:02:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:23,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:02:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:23,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:02:23,679 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:02:23,680 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:02:23,680 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:02:23,680 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:02:23,680 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:02:23,680 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:23,680 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:02:23,680 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:02:23,680 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration2_Loop [2022-07-13 04:02:23,681 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:02:23,681 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:02:23,681 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-13 04:02:23,720 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:02:23,720 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:02:23,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:23,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:23,722 INFO L229 MonitoredProcess]: Starting monitored process 6 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-13 04:02:23,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 04:02:23,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:02:23,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:02:23,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 04:02:23,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:23,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:23,762 INFO L229 MonitoredProcess]: Starting monitored process 7 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-13 04:02:23,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 04:02:23,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:02:23,766 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:02:23,803 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:02:23,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 04:02:23,809 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:02:23,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:02:23,809 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:02:23,809 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:02:23,809 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:02:23,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:23,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:02:23,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:02:23,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration2_Loop [2022-07-13 04:02:23,810 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:02:23,810 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:02:23,810 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-13 04:02:23,847 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:02:23,848 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:02:23,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:23,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:23,852 INFO L229 MonitoredProcess]: Starting monitored process 8 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-13 04:02:23,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 04:02:23,854 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-13 04:02:23,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:02:23,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:02:23,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:02:23,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:02:23,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:02:23,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:02:23,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:02:23,876 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:02:23,879 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:02:23,879 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 04:02:23,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:23,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:23,880 INFO L229 MonitoredProcess]: Starting monitored process 9 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-13 04:02:23,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 04:02:23,883 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:02:23,883 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:02:23,883 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:02:23,883 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -1*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 Supporting invariants [] [2022-07-13 04:02:23,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 04:02:23,903 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:02:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:23,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:02:23,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:02:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:24,025 WARN L261 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 04:02:24,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:02:24,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 04:02:24,262 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-13 04:02:24,263 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-13 04:02:24,263 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18479 states and 34519 transitions. cyclomatic complexity: 16074 Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:30,189 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18479 states and 34519 transitions. cyclomatic complexity: 16074. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 202763 states and 379773 transitions. Complement of second has 17 states. [2022-07-13 04:02:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2022-07-13 04:02:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193304 transitions. [2022-07-13 04:02:30,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 193304 transitions. Stem has 37 letters. Loop has 8 letters. [2022-07-13 04:02:30,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:02:30,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 193304 transitions. Stem has 45 letters. Loop has 8 letters. [2022-07-13 04:02:30,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:02:30,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 193304 transitions. Stem has 37 letters. Loop has 16 letters. [2022-07-13 04:02:30,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:02:30,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202763 states and 379773 transitions. [2022-07-13 04:02:31,305 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 29608 [2022-07-13 04:02:31,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202763 states to 118011 states and 220969 transitions. [2022-07-13 04:02:31,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117962 [2022-07-13 04:02:31,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117963 [2022-07-13 04:02:31,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118011 states and 220969 transitions. [2022-07-13 04:02:31,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:02:31,864 INFO L369 hiAutomatonCegarLoop]: Abstraction has 118011 states and 220969 transitions. [2022-07-13 04:02:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118011 states and 220969 transitions. [2022-07-13 04:02:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118011 to 18503. [2022-07-13 04:02:32,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18503 states, 18503 states have (on average 1.8676430849051504) internal successors, (34557), 18502 states have internal predecessors, (34557), 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-13 04:02:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18503 states to 18503 states and 34557 transitions. [2022-07-13 04:02:32,794 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18503 states and 34557 transitions. [2022-07-13 04:02:32,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:02:32,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:02:32,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:02:32,796 INFO L87 Difference]: Start difference. First operand 18503 states and 34557 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:02:33,699 INFO L93 Difference]: Finished difference Result 55292 states and 103241 transitions. [2022-07-13 04:02:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:02:33,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55292 states and 103241 transitions. [2022-07-13 04:02:33,900 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 12558 [2022-07-13 04:02:34,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55292 states to 55292 states and 103241 transitions. [2022-07-13 04:02:34,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55178 [2022-07-13 04:02:34,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55178 [2022-07-13 04:02:34,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55292 states and 103241 transitions. [2022-07-13 04:02:34,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:02:34,293 INFO L369 hiAutomatonCegarLoop]: Abstraction has 55292 states and 103241 transitions. [2022-07-13 04:02:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55292 states and 103241 transitions. [2022-07-13 04:02:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55292 to 18518. [2022-07-13 04:02:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18518 states, 18518 states have (on average 1.8669402743276813) internal successors, (34572), 18517 states have internal predecessors, (34572), 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-13 04:02:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18518 states to 18518 states and 34572 transitions. [2022-07-13 04:02:34,674 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18518 states and 34572 transitions. [2022-07-13 04:02:34,674 INFO L374 stractBuchiCegarLoop]: Abstraction has 18518 states and 34572 transitions. [2022-07-13 04:02:34,674 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:02:34,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18518 states and 34572 transitions. [2022-07-13 04:02:34,727 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4186 [2022-07-13 04:02:34,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:02:34,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:02:34,729 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:02:34,730 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:02:34,730 INFO L752 eck$LassoCheckResult]: Stem: 625714#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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int(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);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 621961#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 620700#L1414 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 620701#L1407 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 619032#L1422 main_#t~ret30#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 619033#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 620959#L564 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 624866#L1317 assume !(0 == getOrigin_~person#1); 624311#L1321 assume !(1 == getOrigin_~person#1); 624313#L1325 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 621823#L1342 aliceCall_#t~ret19#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 631386#L964 assume 0 == initPersonOnFloor_~floor#1; 631364#L965 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 613905#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 613906#L756 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 614245#L768-2 assume { :end_inline_callOnFloor } true; 628915#L1108 assume { :end_inline_initPersonOnFloor } true; 615252#L324 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 615253#L1317-1 assume !(0 == getOrigin_~person#1); 624702#L1321-1 assume !(1 == getOrigin_~person#1); 623099#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 623100#L1342-1 angelinaCall_#t~ret20#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 631392#L964-1 assume 0 == initPersonOnFloor_~floor#1; 624103#L965-2 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 612888#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 623464#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 620080#L768-5 assume { :end_inline_callOnFloor } true; 622723#L1108-1 assume { :end_inline_initPersonOnFloor } true; 621692#L335 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 621693#L2092 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 622439#L170 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 622440#L2049 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 615332#L3060 assume 0 != timeShift_~tmp~29#1; 615334#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 627377#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 627378#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 625825#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 619166#L3280 assume 1 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i~3#1 := 0;existInLiftCallsInDirection_~i~3#1 := 1 + ~currentFloorID~0; 619167#L3284-2 assume !false; 620065#L3285 [2022-07-13 04:02:34,730 INFO L754 eck$LassoCheckResult]: Loop: 620065#L3285 assume existInLiftCallsInDirection_~i~3#1 < 5; 620067#L3286 assume !(0 == existInLiftCallsInDirection_~i~3#1); 623337#L3299 assume 1 == existInLiftCallsInDirection_~i~3#1; 623947#L3301 assume !(0 != ~floorButtons_1~0); 623948#L3308 assume !(2 == existInLiftCallsInDirection_~i~3#1); 621574#L3317 assume !(3 == existInLiftCallsInDirection_~i~3#1); 623205#L3326 assume !(4 == existInLiftCallsInDirection_~i~3#1); 620235#L3327-1 existInLiftCallsInDirection_~i~3#1 := 1 + existInLiftCallsInDirection_~i~3#1; 620236#L3284-2 assume !false; 620065#L3285 [2022-07-13 04:02:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1800201023, now seen corresponding path program 1 times [2022-07-13 04:02:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:34,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857490928] [2022-07-13 04:02:34,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:34,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:34,782 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-13 04:02:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:02:34,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857490928] [2022-07-13 04:02:34,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857490928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:02:34,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:02:34,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:02:34,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973054567] [2022-07-13 04:02:34,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:02:34,786 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:02:34,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 917806602, now seen corresponding path program 1 times [2022-07-13 04:02:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:34,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262078929] [2022-07-13 04:02:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:34,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:34,793 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:02:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:34,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:02:34,818 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:02:34,818 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:02:34,818 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:02:34,818 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:02:34,818 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:02:34,818 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:34,818 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:02:34,819 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:02:34,819 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration3_Loop [2022-07-13 04:02:34,819 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:02:34,819 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:02:34,819 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-13 04:02:34,823 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-13 04:02:34,841 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:02:34,841 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:02:34,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:34,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:34,843 INFO L229 MonitoredProcess]: Starting monitored process 10 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-13 04:02:34,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-13 04:02:34,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:02:34,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:02:34,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 04:02:34,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:34,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:34,893 INFO L229 MonitoredProcess]: Starting monitored process 11 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-13 04:02:34,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 04:02:34,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:02:34,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:02:34,917 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:02:34,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 04:02:34,933 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:02:34,933 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:02:34,933 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:02:34,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:02:34,933 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:02:34,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:34,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:02:34,933 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:02:34,933 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec13_product32.cil.c_Iteration3_Loop [2022-07-13 04:02:34,933 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:02:34,933 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:02:34,933 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-13 04:02:34,938 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-13 04:02:34,956 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:02:34,956 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:02:34,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:34,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:34,959 INFO L229 MonitoredProcess]: Starting monitored process 12 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-13 04:02:34,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 04:02:34,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 04:02:34,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:02:34,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:02:34,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:02:34,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:02:34,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:02:34,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:02:34,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:02:34,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:02:34,986 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:02:34,986 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 04:02:34,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:02:34,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:02:34,988 INFO L229 MonitoredProcess]: Starting monitored process 13 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-13 04:02:34,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 04:02:34,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:02:34,991 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:02:34,991 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:02:34,991 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_existInLiftCallsInDirection_~i~3#1) = -2*ULTIMATE.start_existInLiftCallsInDirection_~i~3#1 + 3 Supporting invariants [] [2022-07-13 04:02:35,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-13 04:02:35,007 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:02:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:35,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:02:35,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:02:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:35,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:02:35,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:02:35,185 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-13 04:02:35,186 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-13 04:02:35,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18518 states and 34572 transitions. cyclomatic complexity: 16089 Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:35,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 04:02:37,210 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18518 states and 34572 transitions. cyclomatic complexity: 16089. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 104618 states and 195695 transitions. Complement of second has 8 states. [2022-07-13 04:02:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:02:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114982 transitions. [2022-07-13 04:02:37,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 114982 transitions. Stem has 39 letters. Loop has 9 letters. [2022-07-13 04:02:37,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:02:37,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 114982 transitions. Stem has 48 letters. Loop has 9 letters. [2022-07-13 04:02:37,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:02:37,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 114982 transitions. Stem has 39 letters. Loop has 18 letters. [2022-07-13 04:02:37,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:02:37,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104618 states and 195695 transitions. [2022-07-13 04:02:37,836 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 15378 [2022-07-13 04:02:38,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104618 states to 61565 states and 115126 transitions. [2022-07-13 04:02:38,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61483 [2022-07-13 04:02:38,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61486 [2022-07-13 04:02:38,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61565 states and 115126 transitions. [2022-07-13 04:02:38,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:02:38,116 INFO L369 hiAutomatonCegarLoop]: Abstraction has 61565 states and 115126 transitions. [2022-07-13 04:02:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61565 states and 115126 transitions. [2022-07-13 04:02:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61565 to 18560. [2022-07-13 04:02:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18560 states, 18560 states have (on average 1.8657327586206895) internal successors, (34628), 18559 states have internal predecessors, (34628), 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-13 04:02:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 34628 transitions. [2022-07-13 04:02:38,543 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18560 states and 34628 transitions. [2022-07-13 04:02:38,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:02:38,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:02:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:02:38,544 INFO L87 Difference]: Start difference. First operand 18560 states and 34628 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:02:38,960 INFO L93 Difference]: Finished difference Result 36941 states and 68929 transitions. [2022-07-13 04:02:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:02:38,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36941 states and 68929 transitions. [2022-07-13 04:02:39,337 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 8364 [2022-07-13 04:02:39,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36941 states to 36941 states and 68929 transitions. [2022-07-13 04:02:39,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36783 [2022-07-13 04:02:39,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36783 [2022-07-13 04:02:39,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36941 states and 68929 transitions. [2022-07-13 04:02:39,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:02:39,451 INFO L369 hiAutomatonCegarLoop]: Abstraction has 36941 states and 68929 transitions. [2022-07-13 04:02:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36941 states and 68929 transitions. [2022-07-13 04:02:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36941 to 18526. [2022-07-13 04:02:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18526 states, 18526 states have (on average 1.865486343517219) internal successors, (34560), 18525 states have internal predecessors, (34560), 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-13 04:02:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18526 states to 18526 states and 34560 transitions. [2022-07-13 04:02:39,723 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18526 states and 34560 transitions. [2022-07-13 04:02:39,723 INFO L374 stractBuchiCegarLoop]: Abstraction has 18526 states and 34560 transitions. [2022-07-13 04:02:39,724 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:02:39,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18526 states and 34560 transitions. [2022-07-13 04:02:39,766 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2022-07-13 04:02:39,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:02:39,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:02:39,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:02:39,767 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:02:39,769 INFO L752 eck$LassoCheckResult]: Stem: 804501#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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int(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);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 800756#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 799501#L1414 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 799502#L1407 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 797836#L1422 main_#t~ret30#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 797837#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 799760#L564 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 803655#L1317 assume !(0 == getOrigin_~person#1); 803101#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 803102#L1342 aliceCall_#t~ret19#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 808079#L964 assume !(0 == initPersonOnFloor_~floor#1); 809065#L991 assume !(1 == initPersonOnFloor_~floor#1); 801072#L1018 assume !(2 == initPersonOnFloor_~floor#1); 795602#L1045 assume 3 == initPersonOnFloor_~floor#1; 795603#L1046 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_3~0 := 1; 792711#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 792712#L756 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 793051#L768-2 assume { :end_inline_callOnFloor } true; 807698#L1108 assume { :end_inline_initPersonOnFloor } true; 794061#L324 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 794062#L1317-1 assume !(0 == getOrigin_~person#1); 803491#L1321-1 assume !(1 == getOrigin_~person#1); 801891#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 801892#L1342-1 angelinaCall_#t~ret20#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 810168#L964-1 assume 0 == initPersonOnFloor_~floor#1; 802894#L965-2 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 791694#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 802257#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 798881#L768-5 assume { :end_inline_callOnFloor } true; 801516#L1108-1 assume { :end_inline_initPersonOnFloor } true; 800492#L335 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 800493#L2092 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 801234#L170 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 801235#L2049 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 794138#L3060 assume 0 != timeShift_~tmp~29#1; 794140#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 806164#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 806165#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 804614#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 797970#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 797972#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 801922#L3350-2 [2022-07-13 04:02:39,775 INFO L754 eck$LassoCheckResult]: Loop: 801922#L3350-2 assume !false; 810066#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 808282#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 808283#L3359-2 assume !false; 795254#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 795255#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 801922#L3350-2 [2022-07-13 04:02:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash 790460044, now seen corresponding path program 1 times [2022-07-13 04:02:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:39,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361562031] [2022-07-13 04:02:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:39,813 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-13 04:02:39,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:02:39,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361562031] [2022-07-13 04:02:39,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361562031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:02:39,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:02:39,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:02:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429688415] [2022-07-13 04:02:39,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:02:39,814 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:02:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 1 times [2022-07-13 04:02:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:39,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260167864] [2022-07-13 04:02:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:39,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:39,819 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:02:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:39,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:02:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:02:39,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:02:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:02:39,859 INFO L87 Difference]: Start difference. First operand 18526 states and 34560 transitions. cyclomatic complexity: 16071 Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:02:40,282 INFO L93 Difference]: Finished difference Result 25882 states and 48292 transitions. [2022-07-13 04:02:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:02:40,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25882 states and 48292 transitions. [2022-07-13 04:02:40,574 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 8000 [2022-07-13 04:02:40,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25882 states to 25882 states and 48292 transitions. [2022-07-13 04:02:40,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25803 [2022-07-13 04:02:40,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25803 [2022-07-13 04:02:40,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25882 states and 48292 transitions. [2022-07-13 04:02:40,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:02:40,662 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25882 states and 48292 transitions. [2022-07-13 04:02:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25882 states and 48292 transitions. [2022-07-13 04:02:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25882 to 18526. [2022-07-13 04:02:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18526 states, 18526 states have (on average 1.8651624743603583) internal successors, (34554), 18525 states have internal predecessors, (34554), 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-13 04:02:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18526 states to 18526 states and 34554 transitions. [2022-07-13 04:02:40,900 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18526 states and 34554 transitions. [2022-07-13 04:02:40,900 INFO L374 stractBuchiCegarLoop]: Abstraction has 18526 states and 34554 transitions. [2022-07-13 04:02:40,900 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:02:40,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18526 states and 34554 transitions. [2022-07-13 04:02:40,949 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 4182 [2022-07-13 04:02:40,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:02:40,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:02:40,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:02:40,950 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:02:40,950 INFO L752 eck$LassoCheckResult]: Stem: 848922#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(32, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(10, 16);call #Ultimate.allocInit(4, 17);call write~init~int(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);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~prevDir~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0; 845176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret30#1, main_~retValue_acc~1#1, main_~tmp~11#1;havoc main_~retValue_acc~1#1;havoc main_~tmp~11#1;assume { :begin_inline_select_helpers } true; 843921#L1414 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 843922#L1407 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; 842257#L1422 main_#t~ret30#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~11#1 := main_#t~ret30#1;havoc main_#t~ret30#1; 842258#L591 assume 0 != main_~tmp~11#1;assume { :begin_inline_setup } true; 844180#L564 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;assume { :begin_inline_aliceCall } true;havoc aliceCall_#t~ret19#1, aliceCall_~tmp~4#1;havoc aliceCall_~tmp~4#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 1;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 848075#L1317 assume !(0 == getOrigin_~person#1); 847522#L1321 assume 1 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 3;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 847523#L1342 aliceCall_#t~ret19#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;aliceCall_~tmp~4#1 := aliceCall_#t~ret19#1;havoc aliceCall_#t~ret19#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 1, aliceCall_~tmp~4#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 852499#L964 assume !(0 == initPersonOnFloor_~floor#1); 853486#L991 assume !(1 == initPersonOnFloor_~floor#1); 845492#L1018 assume !(2 == initPersonOnFloor_~floor#1); 840023#L1045 assume 3 == initPersonOnFloor_~floor#1; 840024#L1046 assume !(0 == initPersonOnFloor_~person#1); 853731#L1049 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_3~0 := 1; 837132#L1072-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 837133#L756 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 837472#L768-2 assume { :end_inline_callOnFloor } true; 852119#L1108 assume { :end_inline_initPersonOnFloor } true; 838479#L324 assume { :end_inline_aliceCall } true;assume { :begin_inline_angelinaCall } true;havoc angelinaCall_#t~ret20#1, angelinaCall_~tmp~5#1;havoc angelinaCall_~tmp~5#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 2;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~6#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~6#1; 838480#L1317-1 assume !(0 == getOrigin_~person#1); 847912#L1321-1 assume !(1 == getOrigin_~person#1); 846311#L1325-1 assume 2 == getOrigin_~person#1;getOrigin_~retValue_acc~6#1 := 2;getOrigin_#res#1 := getOrigin_~retValue_acc~6#1; 846312#L1342-1 angelinaCall_#t~ret20#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;angelinaCall_~tmp~5#1 := angelinaCall_#t~ret20#1;havoc angelinaCall_#t~ret20#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 2, angelinaCall_~tmp~5#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 854587#L964-1 assume 0 == initPersonOnFloor_~floor#1; 847315#L965-2 assume !(0 == initPersonOnFloor_~person#1); 847316#L968-2 assume 1 == initPersonOnFloor_~person#1;~personOnFloor_1_0~0 := 1; 836115#L1072-3 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 846677#L756-2 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 843301#L768-5 assume { :end_inline_callOnFloor } true; 845936#L1108-1 assume { :end_inline_initPersonOnFloor } true; 844912#L335 assume { :end_inline_angelinaCall } true;assume { :begin_inline_threeTS } true;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret115#1, timeShift_~tmp~29#1;havoc timeShift_~tmp~29#1;assume { :begin_inline___utac_acc__Specification13_spec__1 } true;havoc __utac_acc__Specification13_spec__1_#t~ret10#1;assume { :begin_inline_getCurrentHeading } true;havoc getCurrentHeading_#res#1;havoc getCurrentHeading_~retValue_acc~17#1;havoc getCurrentHeading_~retValue_acc~17#1;getCurrentHeading_~retValue_acc~17#1 := ~currentHeading~0;getCurrentHeading_#res#1 := getCurrentHeading_~retValue_acc~17#1; 844913#L2092 __utac_acc__Specification13_spec__1_#t~ret10#1 := getCurrentHeading_#res#1;assume { :end_inline_getCurrentHeading } true;~prevDir~0 := __utac_acc__Specification13_spec__1_#t~ret10#1;havoc __utac_acc__Specification13_spec__1_#t~ret10#1; 845654#L170 assume { :end_inline___utac_acc__Specification13_spec__1 } true;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~15#1;havoc areDoorsOpen_~retValue_acc~15#1;areDoorsOpen_~retValue_acc~15#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; 845655#L2049 timeShift_#t~ret115#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~29#1 := timeShift_#t~ret115#1;havoc timeShift_#t~ret115#1; 838559#L3060 assume 0 != timeShift_~tmp~29#1; 838561#L3061 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 850585#L3060-1 assume { :begin_inline___utac_acc__Specification13_spec__2 } true;havoc __utac_acc__Specification13_spec__2_#t~ret11#1, __utac_acc__Specification13_spec__2_#t~ret12#1, __utac_acc__Specification13_spec__2_#t~ret13#1, __utac_acc__Specification13_spec__2_#t~ret14#1, __utac_acc__Specification13_spec__2_#t~ret15#1, __utac_acc__Specification13_spec__2_#t~ret16#1, __utac_acc__Specification13_spec__2_~tmp~2#1, __utac_acc__Specification13_spec__2_~tmp___0~2#1, __utac_acc__Specification13_spec__2_~tmp___1~2#1, __utac_acc__Specification13_spec__2_~tmp___2~0#1, __utac_acc__Specification13_spec__2_~tmp___3~0#1, __utac_acc__Specification13_spec__2_~tmp___4~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1, __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;havoc __utac_acc__Specification13_spec__2_~tmp~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___0~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___1~2#1;havoc __utac_acc__Specification13_spec__2_~tmp___2~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___3~0#1;havoc __utac_acc__Specification13_spec__2_~tmp___4~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1;havoc __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1;__utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 := 2 * ~maximumWeight~0;__utac_acc__Specification13_spec__2_~__cil_tmp8~0#1 := (if __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 < 0 && 0 != __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 % 3 then 1 + __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3 else __utac_acc__Specification13_spec__2_~__cil_tmp7~0#1 / 3); 850586#L188 assume ~weight~0 > __utac_acc__Specification13_spec__2_~__cil_tmp8~0#1; 849033#L189 assume 1 == ~prevDir~0;assume { :begin_inline_existInLiftCallsInDirection } true;existInLiftCallsInDirection_#in~d#1 := 0;havoc existInLiftCallsInDirection_#res#1;havoc existInLiftCallsInDirection_~d#1, existInLiftCallsInDirection_~retValue_acc~29#1, existInLiftCallsInDirection_~i~3#1, existInLiftCallsInDirection_~i___0~0#1;existInLiftCallsInDirection_~d#1 := existInLiftCallsInDirection_#in~d#1;havoc existInLiftCallsInDirection_~retValue_acc~29#1;havoc existInLiftCallsInDirection_~i~3#1;havoc existInLiftCallsInDirection_~i___0~0#1; 842391#L3280 assume !(1 == existInLiftCallsInDirection_~d#1); 842393#L3346 assume 0 == existInLiftCallsInDirection_~d#1;existInLiftCallsInDirection_~i___0~0#1 := 0;existInLiftCallsInDirection_~i___0~0#1 := ~currentFloorID~0 - 1; 846342#L3350-2 [2022-07-13 04:02:40,951 INFO L754 eck$LassoCheckResult]: Loop: 846342#L3350-2 assume !false; 854489#L3351 assume existInLiftCallsInDirection_~i___0~0#1 >= 0; 852703#L3352 existInLiftCallsInDirection_~i___0~0#1 := 1 + ~currentFloorID~0; 852704#L3359-2 assume !false; 839675#L3360 assume !(existInLiftCallsInDirection_~i___0~0#1 < 5); 839676#L3418 existInLiftCallsInDirection_~i___0~0#1 := existInLiftCallsInDirection_~i___0~0#1 - 1; 846342#L3350-2 [2022-07-13 04:02:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1011904592, now seen corresponding path program 1 times [2022-07-13 04:02:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:40,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023310091] [2022-07-13 04:02:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:02:40,982 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-13 04:02:40,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:02:40,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023310091] [2022-07-13 04:02:40,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023310091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:02:40,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:02:40,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:02:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299802389] [2022-07-13 04:02:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:02:40,983 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:02:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:02:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2025047829, now seen corresponding path program 2 times [2022-07-13 04:02:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:02:40,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445227493] [2022-07-13 04:02:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:02:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:02:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:40,989 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:02:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:02:40,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:02:41,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:02:41,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:02:41,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:02:41,007 INFO L87 Difference]: Start difference. First operand 18526 states and 34554 transitions. cyclomatic complexity: 16065 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:02:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:02:41,814 INFO L93 Difference]: Finished difference Result 55377 states and 103323 transitions. [2022-07-13 04:02:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:02:41,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55377 states and 103323 transitions. [2022-07-13 04:02:42,035 INFO L131 ngComponentsAnalysis]: Automaton has 99 accepting balls. 12546 [2022-07-13 04:02:42,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55377 states to 55377 states and 103323 transitions. [2022-07-13 04:02:42,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55140 [2022-07-13 04:02:42,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55140 [2022-07-13 04:02:42,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55377 states and 103323 transitions. [2022-07-13 04:02:42,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:02:42,246 INFO L369 hiAutomatonCegarLoop]: Abstraction has 55377 states and 103323 transitions. [2022-07-13 04:02:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55377 states and 103323 transitions. [2022-07-13 04:02:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55377 to 18530. [2022-07-13 04:02:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18530 states, 18530 states have (on average 1.8649217485159202) internal successors, (34557), 18529 states have internal predecessors, (34557), 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)