./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product28.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 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 02:31:32,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:31:32,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:31:32,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:31:32,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:31:32,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:31:32,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:31:32,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:31:32,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:31:32,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:31:32,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:31:32,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:31:32,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:31:32,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:31:32,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:31:32,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:31:32,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:31:32,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:31:32,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:31:32,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:31:32,201 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:31:32,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:31:32,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:31:32,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:31:32,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:31:32,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:31:32,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:31:32,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:31:32,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:31:32,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:31:32,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:31:32,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:31:32,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:31:32,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:31:32,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:31:32,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:31:32,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:31:32,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:31:32,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:31:32,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:31:32,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:31:32,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:31:32,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:31:32,261 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:31:32,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:31:32,262 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:31:32,262 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:31:32,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:31:32,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:31:32,263 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:31:32,263 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:31:32,264 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:31:32,264 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:31:32,265 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:31:32,265 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:31:32,265 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:31:32,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:31:32,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:31:32,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:31:32,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:31:32,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:31:32,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:31:32,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:31:32,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:31:32,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:31:32,267 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:31:32,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:31:32,267 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:31:32,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:31:32,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:31:32,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:31:32,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:31:32,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:31:32,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:31:32,270 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:31:32,270 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 -> 339ae17141354782861ad14ce1f1515b53735bca35311ebbaf6a68a6022f4172 [2022-07-22 02:31:32,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:31:32,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:31:32,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:31:32,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:31:32,618 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:31:32,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2022-07-22 02:31:32,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8822e9ce1/8eae87d73b404ec9a3017df4f2088cfb/FLAG84418ea8b [2022-07-22 02:31:33,248 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:31:33,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c [2022-07-22 02:31:33,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8822e9ce1/8eae87d73b404ec9a3017df4f2088cfb/FLAG84418ea8b [2022-07-22 02:31:33,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8822e9ce1/8eae87d73b404ec9a3017df4f2088cfb [2022-07-22 02:31:33,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:31:33,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:31:33,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:31:33,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:31:33,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:31:33,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:31:33" (1/1) ... [2022-07-22 02:31:33,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c732ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:33, skipping insertion in model container [2022-07-22 02:31:33,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:31:33" (1/1) ... [2022-07-22 02:31:33,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:31:33,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:31:34,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c[73050,73063] [2022-07-22 02:31:34,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:31:34,028 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:31:34,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product28.cil.c[73050,73063] [2022-07-22 02:31:34,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:31:34,155 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:31:34,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34 WrapperNode [2022-07-22 02:31:34,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:31:34,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:31:34,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:31:34,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:31:34,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,433 INFO L137 Inliner]: procedures = 97, calls = 345, calls flagged for inlining = 197, calls inlined = 616, statements flattened = 18362 [2022-07-22 02:31:34,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:31:34,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:31:34,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:31:34,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:31:34,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:31:34,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:31:34,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:31:34,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:31:34,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (1/1) ... [2022-07-22 02:31:34,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:31:34,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:31:34,960 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-22 02:31:34,965 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-22 02:31:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:31:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:31:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:31:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:31:35,168 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:31:35,170 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:31:40,888 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:31:40,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:31:40,939 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 02:31:40,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:31:40 BoogieIcfgContainer [2022-07-22 02:31:40,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:31:40,949 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:31:40,949 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:31:40,951 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:31:40,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:31:40,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:31:33" (1/3) ... [2022-07-22 02:31:40,953 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@556d046e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:31:40, skipping insertion in model container [2022-07-22 02:31:40,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:31:40,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:31:34" (2/3) ... [2022-07-22 02:31:40,954 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@556d046e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:31:40, skipping insertion in model container [2022-07-22 02:31:40,954 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:31:40,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:31:40" (3/3) ... [2022-07-22 02:31:40,955 INFO L354 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product28.cil.c [2022-07-22 02:31:41,114 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:31:41,114 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:31:41,115 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:31:41,115 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:31:41,115 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:31:41,115 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:31:41,115 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:31:41,116 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:31:41,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5173 states, 5172 states have (on average 1.863109048723898) internal successors, (9636), 5172 states have internal predecessors, (9636), 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-22 02:31:41,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2570 [2022-07-22 02:31:41,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:31:41,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:31:41,270 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:31:41,270 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:31:41,271 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:31:41,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5173 states, 5172 states have (on average 1.863109048723898) internal successors, (9636), 5172 states have internal predecessors, (9636), 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-22 02:31:41,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2570 [2022-07-22 02:31:41,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:31:41,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:31:41,343 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:31:41,344 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:31:41,349 INFO L752 eck$LassoCheckResult]: Stem: 3228#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~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;~head~0.base, ~head~0.offset := 0, 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12; 5061#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret127#1, main_~retValue_acc~29#1, main_~tmp~27#1;havoc main_~retValue_acc~29#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true; 4383#L863true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 792#L856true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; 2541#L871true main_#t~ret127#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret127#1;havoc main_#t~ret127#1; 4125#L3348true assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true; 4829#L3322true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification9_spec__1 } true;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 2397#L2865true assume { :end_inline___utac_acc__Specification9_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret120#1, bigMacCall_~tmp~24#1;havoc bigMacCall_~tmp~24#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 5;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~4#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~4#1; 2499#L763true assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~4#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~4#1; 1452#L788true bigMacCall_#t~ret120#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~24#1 := bigMacCall_#t~ret120#1;havoc bigMacCall_#t~ret120#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 5, bigMacCall_~tmp~24#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 4999#L409true assume 0 == initPersonOnFloor_~floor#1; 3669#L410true assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 1174#L517-1true assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 2820#L201true assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 3415#L213-2true assume { :end_inline_callOnFloor } true; 2840#L553true assume { :end_inline_initPersonOnFloor } true; 3987#L3127true assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret121#1, cleanup_#t~ret122#1, cleanup_~i~1#1, cleanup_~tmp~25#1, cleanup_~tmp___0~9#1, cleanup_~__cil_tmp4~2#1;havoc cleanup_~i~1#1;havoc cleanup_~tmp~25#1;havoc cleanup_~tmp___0~9#1;havoc cleanup_~__cil_tmp4~2#1;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret58#1, timeShift_~tmp~12#1;havoc timeShift_~tmp~12#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 4868#L1147true timeShift_#t~ret58#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~12#1 := timeShift_#t~ret58#1;havoc timeShift_#t~ret58#1; 3411#L2090true assume 0 != timeShift_~tmp~12#1; 3965#L2091true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3992#L2090-1true assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret111#1, __utac_acc__Specification9_spec__3_#t~ret112#1, __utac_acc__Specification9_spec__3_#t~ret113#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~18#1, __utac_acc__Specification9_spec__3_~tmp___0~8#1, __utac_acc__Specification9_spec__3_~tmp___1~5#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~18#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~8#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~5#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~9#1;havoc getCurrentFloorID_~retValue_acc~9#1;getCurrentFloorID_~retValue_acc~9#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~9#1; 3271#L1138-6true __utac_acc__Specification9_spec__3_#t~ret111#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~18#1 := __utac_acc__Specification9_spec__3_#t~ret111#1;havoc __utac_acc__Specification9_spec__3_#t~ret111#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~18#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~13#1;havoc isEmpty_~retValue_acc~13#1; 1857#L1198-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; 2667#L1230-12true __utac_acc__Specification9_spec__3_#t~ret112#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~5#1 := __utac_acc__Specification9_spec__3_#t~ret112#1;havoc __utac_acc__Specification9_spec__3_#t~ret112#1; 3592#L2908true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~5#1;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 672#L2918-1true assume { :end_inline___utac_acc__Specification9_spec__3 } true; 1335#L2108true assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 0; 3693#L3154-2true [2022-07-22 02:31:41,350 INFO L754 eck$LassoCheckResult]: Loop: 3693#L3154-2true assume !false; 2488#L3155true cleanup_~__cil_tmp4~2#1 := ~cleanupTimeShifts~0 - 1; 3926#L3158true assume cleanup_~i~1#1 < cleanup_~__cil_tmp4~2#1;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res#1;havoc isBlocked_~retValue_acc~8#1;havoc isBlocked_~retValue_acc~8#1;isBlocked_~retValue_acc~8#1 := ~blocked~0;isBlocked_#res#1 := isBlocked_~retValue_acc~8#1; 1615#L960true cleanup_#t~ret121#1 := isBlocked_#res#1;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~9#1 := cleanup_#t~ret121#1;havoc cleanup_#t~ret121#1; 6#L3162true assume 1 != cleanup_~tmp___0~9#1; 5014#L3162-1true assume { :begin_inline_isIdle } true;havoc isIdle_#res#1;havoc isIdle_#t~ret13#1, isIdle_~retValue_acc~15#1, isIdle_~tmp~4#1;havoc isIdle_~retValue_acc~15#1;havoc isIdle_~tmp~4#1;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res#1;havoc anyStopRequested_#t~ret8#1, anyStopRequested_#t~ret9#1, anyStopRequested_#t~ret10#1, anyStopRequested_#t~ret11#1, anyStopRequested_#t~ret12#1, anyStopRequested_~retValue_acc~14#1, anyStopRequested_~tmp~3#1, anyStopRequested_~tmp___0~0#1, anyStopRequested_~tmp___1~0#1, anyStopRequested_~tmp___2~0#1, anyStopRequested_~tmp___3~0#1;havoc anyStopRequested_~retValue_acc~14#1;havoc anyStopRequested_~tmp~3#1;havoc anyStopRequested_~tmp___0~0#1;havoc anyStopRequested_~tmp___1~0#1;havoc anyStopRequested_~tmp___2~0#1;havoc anyStopRequested_~tmp___3~0#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := 0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~0#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~0#1; 4729#L138-50true assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~0#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~0#1; 2971#L165-50true anyStopRequested_#t~ret8#1 := isFloorCalling_#res#1;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~0#1 := anyStopRequested_#t~ret8#1;havoc anyStopRequested_#t~ret8#1; 1019#L1246true assume 0 != anyStopRequested_~tmp___3~0#1;anyStopRequested_~retValue_acc~14#1 := 1;anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; 1399#L1310true isIdle_#t~ret13#1 := anyStopRequested_#res#1;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~4#1 := isIdle_#t~ret13#1;havoc isIdle_#t~ret13#1;isIdle_~retValue_acc~15#1 := (if 0 == isIdle_~tmp~4#1 then 1 else 0);isIdle_#res#1 := isIdle_~retValue_acc~15#1; 5076#L1323true cleanup_#t~ret122#1 := isIdle_#res#1;assume { :end_inline_isIdle } true;cleanup_~tmp~25#1 := cleanup_#t~ret122#1;havoc cleanup_#t~ret122#1; 1311#L3174true assume !(0 != cleanup_~tmp~25#1);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret58#1, timeShift_~tmp~12#1;havoc timeShift_~tmp~12#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 514#L1147-2true timeShift_#t~ret58#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~12#1 := timeShift_#t~ret58#1;havoc timeShift_#t~ret58#1; 2489#L2090-2true assume 0 != timeShift_~tmp~12#1; 1265#L2091-3true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 194#L2090-3true assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret111#1, __utac_acc__Specification9_spec__3_#t~ret112#1, __utac_acc__Specification9_spec__3_#t~ret113#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~18#1, __utac_acc__Specification9_spec__3_~tmp___0~8#1, __utac_acc__Specification9_spec__3_~tmp___1~5#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~18#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~8#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~5#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~9#1;havoc getCurrentFloorID_~retValue_acc~9#1;getCurrentFloorID_~retValue_acc~9#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~9#1; 3298#L1138-13true __utac_acc__Specification9_spec__3_#t~ret111#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~18#1 := __utac_acc__Specification9_spec__3_#t~ret111#1;havoc __utac_acc__Specification9_spec__3_#t~ret111#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~18#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~13#1;havoc isEmpty_~retValue_acc~13#1; 3074#L1198-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; 703#L1230-25true __utac_acc__Specification9_spec__3_#t~ret112#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~5#1 := __utac_acc__Specification9_spec__3_#t~ret112#1;havoc __utac_acc__Specification9_spec__3_#t~ret112#1; 2362#L2908-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~5#1;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 4101#L2918-3true assume { :end_inline___utac_acc__Specification9_spec__3 } true; 81#L2108-1true assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 1 + cleanup_~i~1#1; 3693#L3154-2true [2022-07-22 02:31:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:31:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1768245152, now seen corresponding path program 1 times [2022-07-22 02:31:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:31:41,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204260013] [2022-07-22 02:31:41,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:31:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:31:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:31:41,598 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-22 02:31:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:31:41,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204260013] [2022-07-22 02:31:41,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204260013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:31:41,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:31:41,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:31:41,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647735307] [2022-07-22 02:31:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:31:41,605 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:31:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:31:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1212899440, now seen corresponding path program 1 times [2022-07-22 02:31:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:31:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557058156] [2022-07-22 02:31:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:31:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:31:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:31:41,642 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-22 02:31:41,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:31:41,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557058156] [2022-07-22 02:31:41,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557058156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:31:41,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:31:41,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:31:41,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266833941] [2022-07-22 02:31:41,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:31:41,645 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:31:41,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:31:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:31:41,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:31:41,686 INFO L87 Difference]: Start difference. First operand has 5173 states, 5172 states have (on average 1.863109048723898) internal successors, (9636), 5172 states have internal predecessors, (9636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:31:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:31:42,533 INFO L93 Difference]: Finished difference Result 13662 states and 25438 transitions. [2022-07-22 02:31:42,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:31:42,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13662 states and 25438 transitions. [2022-07-22 02:31:42,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9310 [2022-07-22 02:31:42,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13662 states to 13608 states and 25377 transitions. [2022-07-22 02:31:42,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13608 [2022-07-22 02:31:42,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13608 [2022-07-22 02:31:42,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13608 states and 25377 transitions. [2022-07-22 02:31:42,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:31:42,910 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13608 states and 25377 transitions. [2022-07-22 02:31:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13608 states and 25377 transitions. [2022-07-22 02:31:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13608 to 5154. [2022-07-22 02:31:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5154 states have (on average 1.8639891346526969) internal successors, (9607), 5153 states have internal predecessors, (9607), 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-22 02:31:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 9607 transitions. [2022-07-22 02:31:43,096 INFO L392 hiAutomatonCegarLoop]: Abstraction has 5154 states and 9607 transitions. [2022-07-22 02:31:43,097 INFO L374 stractBuchiCegarLoop]: Abstraction has 5154 states and 9607 transitions. [2022-07-22 02:31:43,097 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:31:43,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5154 states and 9607 transitions. [2022-07-22 02:31:43,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2572 [2022-07-22 02:31:43,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:31:43,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:31:43,117 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:31:43,117 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:31:43,117 INFO L752 eck$LassoCheckResult]: Stem: 23369#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~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;~head~0.base, ~head~0.offset := 0, 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12; 23370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret127#1, main_~retValue_acc~29#1, main_~tmp~27#1;havoc main_~retValue_acc~29#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true; 23903#L863 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 20513#L856 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; 20514#L871 main_#t~ret127#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret127#1;havoc main_#t~ret127#1; 22817#L3348 assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true; 23823#L3322 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification9_spec__1 } true;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 22669#L2865 assume { :end_inline___utac_acc__Specification9_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret120#1, bigMacCall_~tmp~24#1;havoc bigMacCall_~tmp~24#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 5;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~4#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~4#1; 22670#L763 assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~4#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~4#1; 21320#L788 bigMacCall_#t~ret120#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~24#1 := bigMacCall_#t~ret120#1;havoc bigMacCall_#t~ret120#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 5, bigMacCall_~tmp~24#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 21566#L409 assume 0 == initPersonOnFloor_~floor#1; 23618#L410 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 19216#L517-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 21156#L201 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 20971#L213-2 assume { :end_inline_callOnFloor } true; 23068#L553 assume { :end_inline_initPersonOnFloor } true; 23069#L3127 assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret121#1, cleanup_#t~ret122#1, cleanup_~i~1#1, cleanup_~tmp~25#1, cleanup_~tmp___0~9#1, cleanup_~__cil_tmp4~2#1;havoc cleanup_~i~1#1;havoc cleanup_~tmp~25#1;havoc cleanup_~tmp___0~9#1;havoc cleanup_~__cil_tmp4~2#1;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret58#1, timeShift_~tmp~12#1;havoc timeShift_~tmp~12#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 23763#L1147 timeShift_#t~ret58#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~12#1 := timeShift_#t~ret58#1;havoc timeShift_#t~ret58#1; 23485#L2090 assume 0 != timeShift_~tmp~12#1; 23486#L2091 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 21048#L2090-1 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret111#1, __utac_acc__Specification9_spec__3_#t~ret112#1, __utac_acc__Specification9_spec__3_#t~ret113#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~18#1, __utac_acc__Specification9_spec__3_~tmp___0~8#1, __utac_acc__Specification9_spec__3_~tmp___1~5#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~18#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~8#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~5#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~9#1;havoc getCurrentFloorID_~retValue_acc~9#1;getCurrentFloorID_~retValue_acc~9#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~9#1; 23398#L1138-6 __utac_acc__Specification9_spec__3_#t~ret111#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~18#1 := __utac_acc__Specification9_spec__3_#t~ret111#1;havoc __utac_acc__Specification9_spec__3_#t~ret111#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~18#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~13#1;havoc isEmpty_~retValue_acc~13#1; 22084#L1198-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; 19589#L1230-12 __utac_acc__Specification9_spec__3_#t~ret112#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~5#1 := __utac_acc__Specification9_spec__3_#t~ret112#1;havoc __utac_acc__Specification9_spec__3_#t~ret112#1; 23584#L2908 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5#1);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 20422#L1147-1 __utac_acc__Specification9_spec__3_#t~ret113#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~8#1 := __utac_acc__Specification9_spec__3_#t~ret113#1;havoc __utac_acc__Specification9_spec__3_#t~ret113#1; 20423#L2918 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~8#1); 18904#L2918-1 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 20296#L2108 assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 0; 19052#L3154-2 [2022-07-22 02:31:43,118 INFO L754 eck$LassoCheckResult]: Loop: 19052#L3154-2 assume !false; 22767#L3155 cleanup_~__cil_tmp4~2#1 := ~cleanupTimeShifts~0 - 1; 22768#L3158 assume cleanup_~i~1#1 < cleanup_~__cil_tmp4~2#1;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res#1;havoc isBlocked_~retValue_acc~8#1;havoc isBlocked_~retValue_acc~8#1;isBlocked_~retValue_acc~8#1 := ~blocked~0;isBlocked_#res#1 := isBlocked_~retValue_acc~8#1; 21789#L960 cleanup_#t~ret121#1 := isBlocked_#res#1;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~9#1 := cleanup_#t~ret121#1;havoc cleanup_#t~ret121#1; 18859#L3162 assume 1 != cleanup_~tmp___0~9#1; 18860#L3162-1 assume { :begin_inline_isIdle } true;havoc isIdle_#res#1;havoc isIdle_#t~ret13#1, isIdle_~retValue_acc~15#1, isIdle_~tmp~4#1;havoc isIdle_~retValue_acc~15#1;havoc isIdle_~tmp~4#1;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res#1;havoc anyStopRequested_#t~ret8#1, anyStopRequested_#t~ret9#1, anyStopRequested_#t~ret10#1, anyStopRequested_#t~ret11#1, anyStopRequested_#t~ret12#1, anyStopRequested_~retValue_acc~14#1, anyStopRequested_~tmp~3#1, anyStopRequested_~tmp___0~0#1, anyStopRequested_~tmp___1~0#1, anyStopRequested_~tmp___2~0#1, anyStopRequested_~tmp___3~0#1;havoc anyStopRequested_~retValue_acc~14#1;havoc anyStopRequested_~tmp~3#1;havoc anyStopRequested_~tmp___0~0#1;havoc anyStopRequested_~tmp___1~0#1;havoc anyStopRequested_~tmp___2~0#1;havoc anyStopRequested_~tmp___3~0#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := 0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~0#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~0#1; 23971#L138-50 assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~0#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~0#1; 20395#L165-50 anyStopRequested_#t~ret8#1 := isFloorCalling_#res#1;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~0#1 := anyStopRequested_#t~ret8#1;havoc anyStopRequested_#t~ret8#1; 20901#L1246 assume 0 != anyStopRequested_~tmp___3~0#1;anyStopRequested_~retValue_acc~14#1 := 1;anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; 20902#L1310 isIdle_#t~ret13#1 := anyStopRequested_#res#1;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~4#1 := isIdle_#t~ret13#1;havoc isIdle_#t~ret13#1;isIdle_~retValue_acc~15#1 := (if 0 == isIdle_~tmp~4#1 then 1 else 0);isIdle_#res#1 := isIdle_~retValue_acc~15#1; 21490#L1323 cleanup_#t~ret122#1 := isIdle_#res#1;assume { :end_inline_isIdle } true;cleanup_~tmp~25#1 := cleanup_#t~ret122#1;havoc cleanup_#t~ret122#1; 21359#L3174 assume !(0 != cleanup_~tmp~25#1);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret58#1, timeShift_~tmp~12#1;havoc timeShift_~tmp~12#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 20005#L1147-2 timeShift_#t~ret58#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~12#1 := timeShift_#t~ret58#1;havoc timeShift_#t~ret58#1; 20006#L2090-2 assume 0 != timeShift_~tmp~12#1; 21294#L2091-3 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 19331#L2090-3 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret111#1, __utac_acc__Specification9_spec__3_#t~ret112#1, __utac_acc__Specification9_spec__3_#t~ret113#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~18#1, __utac_acc__Specification9_spec__3_~tmp___0~8#1, __utac_acc__Specification9_spec__3_~tmp___1~5#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~18#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~8#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~5#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~9#1;havoc getCurrentFloorID_~retValue_acc~9#1;getCurrentFloorID_~retValue_acc~9#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~9#1; 19332#L1138-13 __utac_acc__Specification9_spec__3_#t~ret111#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~18#1 := __utac_acc__Specification9_spec__3_#t~ret111#1;havoc __utac_acc__Specification9_spec__3_#t~ret111#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~18#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~13#1;havoc isEmpty_~retValue_acc~13#1; 23251#L1198-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; 22473#L1230-25 __utac_acc__Specification9_spec__3_#t~ret112#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~5#1 := __utac_acc__Specification9_spec__3_#t~ret112#1;havoc __utac_acc__Specification9_spec__3_#t~ret112#1; 22639#L2908-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5#1);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 22640#L1147-3 __utac_acc__Specification9_spec__3_#t~ret113#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~8#1 := __utac_acc__Specification9_spec__3_#t~ret113#1;havoc __utac_acc__Specification9_spec__3_#t~ret113#1; 23942#L2918-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~8#1); 20806#L2918-3 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 19051#L2108-1 assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 1 + cleanup_~i~1#1; 19052#L3154-2 [2022-07-22 02:31:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:31:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1523253821, now seen corresponding path program 1 times [2022-07-22 02:31:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:31:43,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607169895] [2022-07-22 02:31:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:31:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:31:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:31:43,166 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-22 02:31:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:31:43,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607169895] [2022-07-22 02:31:43,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607169895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:31:43,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:31:43,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:31:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336790929] [2022-07-22 02:31:43,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:31:43,168 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:31:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:31:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1659633677, now seen corresponding path program 1 times [2022-07-22 02:31:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:31:43,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378352563] [2022-07-22 02:31:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:31:43,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:31:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:31:43,217 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-22 02:31:43,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:31:43,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378352563] [2022-07-22 02:31:43,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378352563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:31:43,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:31:43,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 02:31:43,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259103048] [2022-07-22 02:31:43,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:31:43,220 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:31:43,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:31:43,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 02:31:43,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 02:31:43,221 INFO L87 Difference]: Start difference. First operand 5154 states and 9607 transitions. cyclomatic complexity: 4454 Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:31:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:31:43,714 INFO L93 Difference]: Finished difference Result 8501 states and 15716 transitions. [2022-07-22 02:31:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 02:31:43,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8501 states and 15716 transitions. [2022-07-22 02:31:43,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6809 [2022-07-22 02:31:43,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8501 states to 8501 states and 15716 transitions. [2022-07-22 02:31:43,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8501 [2022-07-22 02:31:43,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8501 [2022-07-22 02:31:43,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8501 states and 15716 transitions. [2022-07-22 02:31:43,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:31:43,950 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8501 states and 15716 transitions. [2022-07-22 02:31:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8501 states and 15716 transitions. [2022-07-22 02:31:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8501 to 4603. [2022-07-22 02:31:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4603 states, 4603 states have (on average 1.8572669997827504) internal successors, (8549), 4602 states have internal predecessors, (8549), 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-22 02:31:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4603 states to 4603 states and 8549 transitions. [2022-07-22 02:31:44,054 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4603 states and 8549 transitions. [2022-07-22 02:31:44,054 INFO L374 stractBuchiCegarLoop]: Abstraction has 4603 states and 8549 transitions. [2022-07-22 02:31:44,055 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:31:44,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4603 states and 8549 transitions. [2022-07-22 02:31:44,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2946 [2022-07-22 02:31:44,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:31:44,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:31:44,072 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:31:44,072 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:31:44,073 INFO L752 eck$LassoCheckResult]: Stem: 36054#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(4, 5);call write~init~int(91, 5, 0, 1);call write~init~int(95, 5, 1, 1);call write~init~int(93, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(91, 6, 0, 1);call write~init~int(93, 6, 1, 1);call write~init~int(32, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(5, 7);call write~init~int(32, 7, 0, 1);call write~init~int(97, 7, 1, 1);call write~init~int(116, 7, 2, 1);call write~init~int(32, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(37, 8, 0, 1);call write~init~int(105, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(3, 10);call write~init~int(117, 10, 0, 1);call write~init~int(112, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(5, 11);call write~init~int(100, 11, 0, 1);call write~init~int(111, 11, 1, 1);call write~init~int(119, 11, 2, 1);call write~init~int(110, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(7, 12);call write~init~int(32, 12, 0, 1);call write~init~int(73, 12, 1, 1);call write~init~int(76, 12, 2, 1);call write~init~int(95, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(4, 13);call write~init~int(32, 13, 0, 1);call write~init~int(37, 13, 1, 1);call write~init~int(105, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(4, 14);call write~init~int(32, 14, 0, 1);call write~init~int(37, 14, 1, 1);call write~init~int(105, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(4, 15);call write~init~int(32, 15, 0, 1);call write~init~int(37, 15, 1, 1);call write~init~int(105, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(4, 16);call write~init~int(32, 16, 0, 1);call write~init~int(37, 16, 1, 1);call write~init~int(105, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(4, 17);call write~init~int(32, 17, 0, 1);call write~init~int(37, 17, 1, 1);call write~init~int(105, 17, 2, 1);call write~init~int(0, 17, 3, 1);call #Ultimate.allocInit(6, 18);call write~init~int(32, 18, 0, 1);call write~init~int(70, 18, 1, 1);call write~init~int(95, 18, 2, 1);call write~init~int(112, 18, 3, 1);call write~init~int(58, 18, 4, 1);call write~init~int(0, 18, 5, 1);call #Ultimate.allocInit(4, 19);call write~init~int(32, 19, 0, 1);call write~init~int(37, 19, 1, 1);call write~init~int(105, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(4, 20);call write~init~int(32, 20, 0, 1);call write~init~int(37, 20, 1, 1);call write~init~int(105, 20, 2, 1);call write~init~int(0, 20, 3, 1);call #Ultimate.allocInit(4, 21);call write~init~int(32, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(105, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(4, 22);call write~init~int(32, 22, 0, 1);call write~init~int(37, 22, 1, 1);call write~init~int(105, 22, 2, 1);call write~init~int(0, 22, 3, 1);call #Ultimate.allocInit(4, 23);call write~init~int(32, 23, 0, 1);call write~init~int(37, 23, 1, 1);call write~init~int(105, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(2, 24);call write~init~int(10, 24, 0, 1);call write~init~int(0, 24, 1, 1);call #Ultimate.allocInit(9, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(21, 28);call #Ultimate.allocInit(30, 29);call #Ultimate.allocInit(9, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(30, 32);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(25, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(9, 36);call #Ultimate.allocInit(25, 37);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~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;~head~0.base, ~head~0.offset := 0, 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~cleanupTimeShifts~0 := 12; 36055#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret127#1, main_~retValue_acc~29#1, main_~tmp~27#1;havoc main_~retValue_acc~29#1;havoc main_~tmp~27#1;assume { :begin_inline_select_helpers } true; 36500#L863 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 33818#L856 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; 33819#L871 main_#t~ret127#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~27#1 := main_#t~ret127#1;havoc main_#t~ret127#1; 35618#L3348 assume 0 != main_~tmp~27#1;assume { :begin_inline_setup } true; 36431#L3322 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification9_spec__1 } true;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 35493#L2865 assume { :end_inline___utac_acc__Specification9_spec__1 } true;assume { :begin_inline_test } true;assume { :begin_inline_bigMacCall } true;havoc bigMacCall_#t~ret120#1, bigMacCall_~tmp~24#1;havoc bigMacCall_~tmp~24#1;assume { :begin_inline_getOrigin } true;getOrigin_#in~person#1 := 5;havoc getOrigin_#res#1;havoc getOrigin_~person#1, getOrigin_~retValue_acc~4#1;getOrigin_~person#1 := getOrigin_#in~person#1;havoc getOrigin_~retValue_acc~4#1; 35494#L763 assume 0 == getOrigin_~person#1;getOrigin_~retValue_acc~4#1 := 4;getOrigin_#res#1 := getOrigin_~retValue_acc~4#1; 34459#L788 bigMacCall_#t~ret120#1 := getOrigin_#res#1;assume { :end_inline_getOrigin } true;bigMacCall_~tmp~24#1 := bigMacCall_#t~ret120#1;havoc bigMacCall_#t~ret120#1;assume { :begin_inline_initPersonOnFloor } true;initPersonOnFloor_#in~person#1, initPersonOnFloor_#in~floor#1 := 5, bigMacCall_~tmp~24#1;havoc initPersonOnFloor_~person#1, initPersonOnFloor_~floor#1;initPersonOnFloor_~person#1 := initPersonOnFloor_#in~person#1;initPersonOnFloor_~floor#1 := initPersonOnFloor_#in~floor#1; 34651#L409 assume 0 == initPersonOnFloor_~floor#1; 36261#L410 assume 0 == initPersonOnFloor_~person#1;~personOnFloor_0_0~0 := 1; 32835#L517-1 assume { :begin_inline_callOnFloor } true;callOnFloor_#in~floorID#1 := initPersonOnFloor_~floor#1;havoc callOnFloor_~floorID#1;callOnFloor_~floorID#1 := callOnFloor_#in~floorID#1; 34326#L201 assume 0 == callOnFloor_~floorID#1;~calls_0~0 := 1; 34174#L213-2 assume { :end_inline_callOnFloor } true; 35818#L553 assume { :end_inline_initPersonOnFloor } true; 35819#L3127 assume { :end_inline_bigMacCall } true;assume { :begin_inline_cleanup } true;havoc cleanup_#t~ret121#1, cleanup_#t~ret122#1, cleanup_~i~1#1, cleanup_~tmp~25#1, cleanup_~tmp___0~9#1, cleanup_~__cil_tmp4~2#1;havoc cleanup_~i~1#1;havoc cleanup_~tmp~25#1;havoc cleanup_~tmp___0~9#1;havoc cleanup_~__cil_tmp4~2#1;assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret58#1, timeShift_~tmp~12#1;havoc timeShift_~tmp~12#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 36380#L1147 timeShift_#t~ret58#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~12#1 := timeShift_#t~ret58#1;havoc timeShift_#t~ret58#1; 36148#L2090 assume 0 != timeShift_~tmp~12#1; 36149#L2091 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 34234#L2090-1 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret111#1, __utac_acc__Specification9_spec__3_#t~ret112#1, __utac_acc__Specification9_spec__3_#t~ret113#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~18#1, __utac_acc__Specification9_spec__3_~tmp___0~8#1, __utac_acc__Specification9_spec__3_~tmp___1~5#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~18#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~8#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~5#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~9#1;havoc getCurrentFloorID_~retValue_acc~9#1;getCurrentFloorID_~retValue_acc~9#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~9#1; 36079#L1138-6 __utac_acc__Specification9_spec__3_#t~ret111#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~18#1 := __utac_acc__Specification9_spec__3_#t~ret111#1;havoc __utac_acc__Specification9_spec__3_#t~ret111#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~18#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~13#1;havoc isEmpty_~retValue_acc~13#1; 35047#L1198-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; 33110#L1230-12 __utac_acc__Specification9_spec__3_#t~ret112#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~5#1 := __utac_acc__Specification9_spec__3_#t~ret112#1;havoc __utac_acc__Specification9_spec__3_#t~ret112#1; 36233#L2908 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5#1);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 33756#L1147-1 __utac_acc__Specification9_spec__3_#t~ret113#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~8#1 := __utac_acc__Specification9_spec__3_#t~ret113#1;havoc __utac_acc__Specification9_spec__3_#t~ret113#1; 33757#L2918 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~8#1; 36135#L2919 assume 0 == __utac_acc__Specification9_spec__3_~floor~0#1; 32591#L2920 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 32593#L2918-1 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 33651#L2108 assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 0; 32719#L3154-2 [2022-07-22 02:31:44,073 INFO L754 eck$LassoCheckResult]: Loop: 32719#L3154-2 assume !false; 36277#L3155 cleanup_~__cil_tmp4~2#1 := ~cleanupTimeShifts~0 - 1; 36650#L3158 assume cleanup_~i~1#1 < cleanup_~__cil_tmp4~2#1;assume { :begin_inline_isBlocked } true;havoc isBlocked_#res#1;havoc isBlocked_~retValue_acc~8#1;havoc isBlocked_~retValue_acc~8#1;isBlocked_~retValue_acc~8#1 := ~blocked~0;isBlocked_#res#1 := isBlocked_~retValue_acc~8#1; 34837#L960 cleanup_#t~ret121#1 := isBlocked_#res#1;assume { :end_inline_isBlocked } true;cleanup_~tmp___0~9#1 := cleanup_#t~ret121#1;havoc cleanup_#t~ret121#1; 32551#L3162 assume 1 != cleanup_~tmp___0~9#1; 32552#L3162-1 assume { :begin_inline_isIdle } true;havoc isIdle_#res#1;havoc isIdle_#t~ret13#1, isIdle_~retValue_acc~15#1, isIdle_~tmp~4#1;havoc isIdle_~retValue_acc~15#1;havoc isIdle_~tmp~4#1;assume { :begin_inline_anyStopRequested } true;havoc anyStopRequested_#res#1;havoc anyStopRequested_#t~ret8#1, anyStopRequested_#t~ret9#1, anyStopRequested_#t~ret10#1, anyStopRequested_#t~ret11#1, anyStopRequested_#t~ret12#1, anyStopRequested_~retValue_acc~14#1, anyStopRequested_~tmp~3#1, anyStopRequested_~tmp___0~0#1, anyStopRequested_~tmp___1~0#1, anyStopRequested_~tmp___2~0#1, anyStopRequested_~tmp___3~0#1;havoc anyStopRequested_~retValue_acc~14#1;havoc anyStopRequested_~tmp~3#1;havoc anyStopRequested_~tmp___0~0#1;havoc anyStopRequested_~tmp___1~0#1;havoc anyStopRequested_~tmp___2~0#1;havoc anyStopRequested_~tmp___3~0#1;assume { :begin_inline_isFloorCalling } true;isFloorCalling_#in~floorID#1 := 0;havoc isFloorCalling_#res#1;havoc isFloorCalling_~floorID#1, isFloorCalling_~retValue_acc~0#1;isFloorCalling_~floorID#1 := isFloorCalling_#in~floorID#1;havoc isFloorCalling_~retValue_acc~0#1; 36555#L138-50 assume 0 == isFloorCalling_~floorID#1;isFloorCalling_~retValue_acc~0#1 := ~calls_0~0;isFloorCalling_#res#1 := isFloorCalling_~retValue_acc~0#1; 33729#L165-50 anyStopRequested_#t~ret8#1 := isFloorCalling_#res#1;assume { :end_inline_isFloorCalling } true;anyStopRequested_~tmp___3~0#1 := anyStopRequested_#t~ret8#1;havoc anyStopRequested_#t~ret8#1; 34111#L1246 assume 0 != anyStopRequested_~tmp___3~0#1;anyStopRequested_~retValue_acc~14#1 := 1;anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; 34112#L1310 isIdle_#t~ret13#1 := anyStopRequested_#res#1;assume { :end_inline_anyStopRequested } true;isIdle_~tmp~4#1 := isIdle_#t~ret13#1;havoc isIdle_#t~ret13#1;isIdle_~retValue_acc~15#1 := (if 0 == isIdle_~tmp~4#1 then 1 else 0);isIdle_#res#1 := isIdle_~retValue_acc~15#1; 34592#L1323 cleanup_#t~ret122#1 := isIdle_#res#1;assume { :end_inline_isIdle } true;cleanup_~tmp~25#1 := cleanup_#t~ret122#1;havoc cleanup_#t~ret122#1; 34491#L3174 assume !(0 != cleanup_~tmp~25#1);assume { :begin_inline_timeShift } true;havoc timeShift_#t~ret58#1, timeShift_~tmp~12#1;havoc timeShift_~tmp~12#1;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 33432#L1147-2 timeShift_#t~ret58#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;timeShift_~tmp~12#1 := timeShift_#t~ret58#1;havoc timeShift_#t~ret58#1; 33433#L2090-2 assume 0 != timeShift_~tmp~12#1; 34436#L2091-3 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 32923#L2090-3 assume { :begin_inline___utac_acc__Specification9_spec__3 } true;havoc __utac_acc__Specification9_spec__3_#t~ret111#1, __utac_acc__Specification9_spec__3_#t~ret112#1, __utac_acc__Specification9_spec__3_#t~ret113#1, __utac_acc__Specification9_spec__3_~floor~0#1, __utac_acc__Specification9_spec__3_~tmp~18#1, __utac_acc__Specification9_spec__3_~tmp___0~8#1, __utac_acc__Specification9_spec__3_~tmp___1~5#1;havoc __utac_acc__Specification9_spec__3_~floor~0#1;havoc __utac_acc__Specification9_spec__3_~tmp~18#1;havoc __utac_acc__Specification9_spec__3_~tmp___0~8#1;havoc __utac_acc__Specification9_spec__3_~tmp___1~5#1;assume { :begin_inline_getCurrentFloorID } true;havoc getCurrentFloorID_#res#1;havoc getCurrentFloorID_~retValue_acc~9#1;havoc getCurrentFloorID_~retValue_acc~9#1;getCurrentFloorID_~retValue_acc~9#1 := ~currentFloorID~0;getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~9#1; 32924#L1138-13 __utac_acc__Specification9_spec__3_#t~ret111#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification9_spec__3_~tmp~18#1 := __utac_acc__Specification9_spec__3_#t~ret111#1;havoc __utac_acc__Specification9_spec__3_#t~ret111#1;__utac_acc__Specification9_spec__3_~floor~0#1 := __utac_acc__Specification9_spec__3_~tmp~18#1;assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1;havoc isEmpty_~retValue_acc~13#1;havoc isEmpty_~retValue_acc~13#1; 36088#L1198-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13#1 := 0;isEmpty_#res#1 := isEmpty_~retValue_acc~13#1; 36918#L1230-25 __utac_acc__Specification9_spec__3_#t~ret112#1 := isEmpty_#res#1;assume { :end_inline_isEmpty } true;__utac_acc__Specification9_spec__3_~tmp___1~5#1 := __utac_acc__Specification9_spec__3_#t~ret112#1;havoc __utac_acc__Specification9_spec__3_#t~ret112#1; 36917#L2908-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~5#1);assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~10#1;havoc areDoorsOpen_~retValue_acc~10#1;areDoorsOpen_~retValue_acc~10#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~10#1; 36912#L1147-3 __utac_acc__Specification9_spec__3_#t~ret113#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification9_spec__3_~tmp___0~8#1 := __utac_acc__Specification9_spec__3_#t~ret113#1;havoc __utac_acc__Specification9_spec__3_#t~ret113#1; 36916#L2918-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~8#1; 36574#L2919-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0#1; 36576#L2920-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 36909#L2918-3 assume { :end_inline___utac_acc__Specification9_spec__3 } true; 32718#L2108-1 assume { :end_inline_timeShift } true;cleanup_~i~1#1 := 1 + cleanup_~i~1#1; 32719#L3154-2 [2022-07-22 02:31:44,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:31:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash 678149864, now seen corresponding path program 1 times [2022-07-22 02:31:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:31:44,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91007317] [2022-07-22 02:31:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:31:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:31:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:31:44,111 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-22 02:31:44,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:31:44,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91007317] [2022-07-22 02:31:44,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91007317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:31:44,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:31:44,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:31:44,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513271623] [2022-07-22 02:31:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:31:44,113 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:31:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:31:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1533486248, now seen corresponding path program 1 times [2022-07-22 02:31:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:31:44,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831744081] [2022-07-22 02:31:44,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:31:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:31:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:31:44,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:31:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:31:44,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:31:44,644 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:31:44,645 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:31:44,645 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:31:44,645 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:31:44,645 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:31:44,645 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:31:44,645 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:31:44,646 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:31:44,646 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product28.cil.c_Iteration3_Loop [2022-07-22 02:31:44,646 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:31:44,646 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:31:44,661 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-22 02:31:44,670 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-22 02:31:44,671 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-22 02:31:44,673 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-22 02:31:44,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:44,680 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-22 02:31:44,682 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-22 02:31:44,684 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-22 02:31:44,686 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-22 02:31:44,687 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-22 02:31:44,689 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-22 02:31:44,691 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-22 02:31:44,695 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-22 02:31:44,700 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-22 02:31:44,708 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-22 02:31:44,710 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-22 02:31:44,718 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-22 02:31:44,720 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-22 02:31:44,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:44,726 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-22 02:31:44,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:44,730 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-22 02:31:44,734 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-22 02:31:44,736 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-22 02:31:44,738 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-22 02:31:44,740 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-22 02:31:44,742 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-22 02:31:44,746 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-22 02:31:44,748 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-22 02:31:45,082 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:31:45,087 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:31:45,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:31:45,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:31:45,090 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-22 02:31:45,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:31:45,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:31:45,104 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-22 02:31:45,163 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-22 02:31:45,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:31:45,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:31:45,166 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-22 02:31:45,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:31:45,174 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:31:45,174 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-22 02:31:45,675 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:31:45,680 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-22 02:31:45,680 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:31:45,680 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:31:45,680 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:31:45,681 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:31:45,681 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:31:45,681 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:31:45,681 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:31:45,681 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:31:45,681 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product28.cil.c_Iteration3_Loop [2022-07-22 02:31:45,681 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:31:45,681 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:31:45,691 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-22 02:31:45,698 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-22 02:31:45,701 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-22 02:31:45,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,723 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-22 02:31:45,729 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-22 02:31:45,732 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-22 02:31:45,739 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-22 02:31:45,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,746 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-22 02:31:45,748 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-22 02:31:45,750 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-22 02:31:45,759 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-22 02:31:45,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,765 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-22 02:31:45,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,769 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-22 02:31:45,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,774 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-22 02:31:45,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:31:45,784 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-22 02:31:45,787 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-22 02:31:45,796 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-22 02:31:46,129 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:31:46,132 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:31:46,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:31:46,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:31:46,137 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-22 02:31:46,139 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-22 02:31:46,140 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-22 02:31:46,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:31:46,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:31:46,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:31:46,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:31:46,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:31:46,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:31:46,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:31:46,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:31:46,167 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 02:31:46,167 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 02:31:46,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:31:46,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:31:46,170 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-22 02:31:46,171 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-22 02:31:46,186 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:31:46,186 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:31:46,187 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:31:46,187 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1#1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1#1 Supporting invariants [] [2022-07-22 02:31:46,212 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-22 02:31:46,214 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:31:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:31:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:31:46,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:31:46,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:31:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:31:46,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 02:31:46,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:31:46,531 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-22 02:31:46,536 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-22 02:31:46,536 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4603 states and 8549 transitions. cyclomatic complexity: 3947 Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:31:46,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 02:31:46,911 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4603 states and 8549 transitions. cyclomatic complexity: 3947. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7549 states and 14024 transitions. Complement of second has 8 states. [2022-07-22 02:31:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 02:31:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:31:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7272 transitions. [2022-07-22 02:31:46,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7272 transitions. Stem has 31 letters. Loop has 26 letters. [2022-07-22 02:31:46,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:31:46,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7272 transitions. Stem has 57 letters. Loop has 26 letters. [2022-07-22 02:31:46,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:31:46,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7272 transitions. Stem has 31 letters. Loop has 52 letters. [2022-07-22 02:31:46,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:31:46,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7549 states and 14024 transitions. [2022-07-22 02:31:46,960 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 02:31:46,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7549 states to 0 states and 0 transitions. [2022-07-22 02:31:46,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 02:31:46,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 02:31:46,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 02:31:46,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:31:46,961 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:31:46,962 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:31:46,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:31:46,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:31:46,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:31:46,963 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:31:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:31:46,963 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-22 02:31:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 02:31:46,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-22 02:31:46,964 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 02:31:46,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 02:31:46,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 02:31:46,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 02:31:46,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 02:31:46,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:31:46,965 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:31:46,965 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:31:46,965 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:31:46,965 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:31:46,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 02:31:46,965 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 02:31:46,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 02:31:46,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 02:31:46 BoogieIcfgContainer [2022-07-22 02:31:46,971 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 02:31:46,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 02:31:46,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 02:31:46,972 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 02:31:46,973 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:31:40" (3/4) ... [2022-07-22 02:31:46,975 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 02:31:46,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 02:31:46,976 INFO L158 Benchmark]: Toolchain (without parser) took 13474.22ms. Allocated memory was 58.7MB in the beginning and 660.6MB in the end (delta: 601.9MB). Free memory was 35.2MB in the beginning and 354.7MB in the end (delta: -319.5MB). Peak memory consumption was 282.4MB. Max. memory is 16.1GB. [2022-07-22 02:31:46,976 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 41.1MB in the beginning and 41.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:31:46,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.18ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.0MB in the beginning and 43.7MB in the end (delta: -8.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2022-07-22 02:31:46,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 277.10ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 43.7MB in the beginning and 51.3MB in the end (delta: -7.6MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2022-07-22 02:31:46,978 INFO L158 Benchmark]: Boogie Preprocessor took 448.05ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 24.7MB in the end (delta: 26.6MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-07-22 02:31:46,978 INFO L158 Benchmark]: RCFGBuilder took 6063.70ms. Allocated memory was 94.4MB in the beginning and 379.6MB in the end (delta: 285.2MB). Free memory was 24.7MB in the beginning and 128.8MB in the end (delta: -104.1MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. [2022-07-22 02:31:46,979 INFO L158 Benchmark]: BuchiAutomizer took 6022.87ms. Allocated memory was 379.6MB in the beginning and 660.6MB in the end (delta: 281.0MB). Free memory was 128.8MB in the beginning and 354.7MB in the end (delta: -225.9MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2022-07-22 02:31:46,979 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 660.6MB. Free memory is still 354.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:31:46,982 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 41.1MB in the beginning and 41.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.18ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.0MB in the beginning and 43.7MB in the end (delta: -8.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 277.10ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 43.7MB in the beginning and 51.3MB in the end (delta: -7.6MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 448.05ms. Allocated memory is still 94.4MB. Free memory was 51.3MB in the beginning and 24.7MB in the end (delta: 26.6MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * RCFGBuilder took 6063.70ms. Allocated memory was 94.4MB in the beginning and 379.6MB in the end (delta: 285.2MB). Free memory was 24.7MB in the beginning and 128.8MB in the end (delta: -104.1MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 6022.87ms. Allocated memory was 379.6MB in the beginning and 660.6MB in the end (delta: 281.0MB). Free memory was 128.8MB in the beginning and 354.7MB in the end (delta: -225.9MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 660.6MB. Free memory is still 354.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 12352 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65972 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65971 mSDsluCounter, 103464 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71680 mSDsCounter, 284 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 284 mSolverCounterUnsat, 31784 mSDtfsCounter, 267 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 54ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 02:31:47,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE