./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 311cf727219391e066955da60e9a83cfca77eaf7b53c342c6934d47c5123e76f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:07:28,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:07:28,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:07:28,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:07:28,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:07:28,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:07:28,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:07:28,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:07:28,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:07:28,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:07:28,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:07:28,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:07:28,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:07:28,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:07:28,144 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:07:28,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:07:28,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:07:28,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:07:28,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:07:28,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:07:28,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:07:28,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:07:28,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:07:28,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:07:28,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:07:28,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:07:28,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:07:28,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:07:28,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:07:28,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:07:28,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:07:28,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:07:28,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:07:28,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:07:28,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:07:28,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:07:28,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:07:28,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:07:28,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:07:28,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:07:28,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:07:28,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:07:28,152 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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(G ! call(reach_error())) ) 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 -> 311cf727219391e066955da60e9a83cfca77eaf7b53c342c6934d47c5123e76f [2024-10-14 03:07:28,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:07:28,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:07:28,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:07:28,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:07:28,357 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:07:28,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c [2024-10-14 03:07:29,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:07:29,800 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:07:29,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c [2024-10-14 03:07:29,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ae38907/7584aab69ce045ce9b778c7a8a3c9a1b/FLAG7b95ae213 [2024-10-14 03:07:30,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ae38907/7584aab69ce045ce9b778c7a8a3c9a1b [2024-10-14 03:07:30,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:07:30,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:07:30,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:07:30,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:07:30,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:07:30,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489b5dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30, skipping insertion in model container [2024-10-14 03:07:30,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:07:30,433 WARN L248 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/minepump_spec1_product51.cil.c[15256,15269] [2024-10-14 03:07:30,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:07:30,464 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:07:30,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-10-14 03:07:30,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2024-10-14 03:07:30,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [343] [2024-10-14 03:07:30,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [709] [2024-10-14 03:07:30,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [718] [2024-10-14 03:07:30,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [756] [2024-10-14 03:07:30,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [782] [2024-10-14 03:07:30,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [878] [2024-10-14 03:07:30,515 WARN L248 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/minepump_spec1_product51.cil.c[15256,15269] [2024-10-14 03:07:30,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:07:30,570 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:07:30,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30 WrapperNode [2024-10-14 03:07:30,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:07:30,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:07:30,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:07:30,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:07:30,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,612 INFO L138 Inliner]: procedures = 56, calls = 100, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 201 [2024-10-14 03:07:30,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:07:30,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:07:30,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:07:30,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:07:30,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,637 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:07:30,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:07:30,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:07:30,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:07:30,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:07:30,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (1/1) ... [2024-10-14 03:07:30,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:07:30,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:07:30,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:07:30,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:07:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:07:30,719 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:07:30,720 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:07:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-14 03:07:30,720 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-14 03:07:30,720 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:07:30,720 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:07:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:07:30,721 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:07:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:07:30,721 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:07:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:07:30,721 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:07:30,721 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-14 03:07:30,722 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-14 03:07:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:07:30,722 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:07:30,722 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:07:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:07:30,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:07:30,795 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:07:30,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:07:31,022 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-14 03:07:31,022 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:07:31,083 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:07:31,083 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:07:31,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:07:31 BoogieIcfgContainer [2024-10-14 03:07:31,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:07:31,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:07:31,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:07:31,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:07:31,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:07:30" (1/3) ... [2024-10-14 03:07:31,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b859b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:07:31, skipping insertion in model container [2024-10-14 03:07:31,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:30" (2/3) ... [2024-10-14 03:07:31,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b859b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:07:31, skipping insertion in model container [2024-10-14 03:07:31,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:07:31" (3/3) ... [2024-10-14 03:07:31,094 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product51.cil.c [2024-10-14 03:07:31,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:07:31,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:07:31,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:07:31,171 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f4a1b0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:07:31,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:07:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 50 states have (on average 1.54) internal successors, (77), 59 states have internal predecessors, (77), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 03:07:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 03:07:31,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:31,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:31,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:31,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:31,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1245759139, now seen corresponding path program 1 times [2024-10-14 03:07:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:31,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932576790] [2024-10-14 03:07:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:07:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932576790] [2024-10-14 03:07:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932576790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:07:31,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022000759] [2024-10-14 03:07:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:31,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:07:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:07:31,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:07:31,386 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.54) internal successors, (77), 59 states have internal predecessors, (77), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:07:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:31,438 INFO L93 Difference]: Finished difference Result 144 states and 207 transitions. [2024-10-14 03:07:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:07:31,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-14 03:07:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:31,448 INFO L225 Difference]: With dead ends: 144 [2024-10-14 03:07:31,449 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 03:07:31,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:07:31,455 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:31,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:07:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 03:07:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 03:07:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.425531914893617) internal successors, (67), 55 states have internal predecessors, (67), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 03:07:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2024-10-14 03:07:31,491 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 16 [2024-10-14 03:07:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:31,491 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2024-10-14 03:07:31,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:07:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-10-14 03:07:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 03:07:31,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:31,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:31,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:07:31,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1480303430, now seen corresponding path program 1 times [2024-10-14 03:07:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:31,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790688989] [2024-10-14 03:07:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:31,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:31,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:07:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:31,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:31,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790688989] [2024-10-14 03:07:31,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790688989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:31,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:07:31,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330392644] [2024-10-14 03:07:31,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:31,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:07:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:07:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:07:31,566 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:07:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:31,598 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2024-10-14 03:07:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:07:31,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-14 03:07:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:31,600 INFO L225 Difference]: With dead ends: 106 [2024-10-14 03:07:31,600 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 03:07:31,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:07:31,601 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:31,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 121 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:07:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 03:07:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 03:07:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 50 states have internal predecessors, (61), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 03:07:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-10-14 03:07:31,609 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 17 [2024-10-14 03:07:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:31,611 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-10-14 03:07:31,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:07:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2024-10-14 03:07:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 03:07:31,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:31,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:31,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:07:31,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:31,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:31,613 INFO L85 PathProgramCache]: Analyzing trace with hash 518131640, now seen corresponding path program 1 times [2024-10-14 03:07:31,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:31,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385828154] [2024-10-14 03:07:31,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:31,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:31,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385828154] [2024-10-14 03:07:31,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385828154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:31,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:31,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:07:31,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953388643] [2024-10-14 03:07:31,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:31,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:07:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:31,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:07:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:07:31,690 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:07:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:31,731 INFO L93 Difference]: Finished difference Result 176 states and 240 transitions. [2024-10-14 03:07:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:07:31,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-14 03:07:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:31,733 INFO L225 Difference]: With dead ends: 176 [2024-10-14 03:07:31,733 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 03:07:31,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:07:31,734 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 68 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:31,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:07:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 03:07:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-10-14 03:07:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.4625) internal successors, (117), 95 states have internal predecessors, (117), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 03:07:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 157 transitions. [2024-10-14 03:07:31,762 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 157 transitions. Word has length 20 [2024-10-14 03:07:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:31,763 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 157 transitions. [2024-10-14 03:07:31,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:07:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 157 transitions. [2024-10-14 03:07:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:07:31,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:31,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:31,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:07:31,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:31,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:31,765 INFO L85 PathProgramCache]: Analyzing trace with hash -189071096, now seen corresponding path program 1 times [2024-10-14 03:07:31,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:31,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207847850] [2024-10-14 03:07:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:31,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:07:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207847850] [2024-10-14 03:07:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207847850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:31,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:07:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582622762] [2024-10-14 03:07:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:31,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:07:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:31,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:07:31,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:07:31,850 INFO L87 Difference]: Start difference. First operand 115 states and 157 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:07:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:31,932 INFO L93 Difference]: Finished difference Result 302 states and 421 transitions. [2024-10-14 03:07:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:07:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-14 03:07:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:31,936 INFO L225 Difference]: With dead ends: 302 [2024-10-14 03:07:31,938 INFO L226 Difference]: Without dead ends: 189 [2024-10-14 03:07:31,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:07:31,942 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 55 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:31,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 185 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:07:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-14 03:07:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2024-10-14 03:07:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 148 states have internal predecessors, (185), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2024-10-14 03:07:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 249 transitions. [2024-10-14 03:07:31,960 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 249 transitions. Word has length 23 [2024-10-14 03:07:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:31,961 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 249 transitions. [2024-10-14 03:07:31,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:07:31,961 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 249 transitions. [2024-10-14 03:07:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 03:07:31,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:31,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:31,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:07:31,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:31,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:31,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1085852697, now seen corresponding path program 1 times [2024-10-14 03:07:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:31,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464879754] [2024-10-14 03:07:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:31,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:07:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:32,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:32,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464879754] [2024-10-14 03:07:32,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464879754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:32,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:32,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:07:32,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201122666] [2024-10-14 03:07:32,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:32,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:07:32,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:32,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:07:32,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:07:32,051 INFO L87 Difference]: Start difference. First operand 188 states and 249 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:07:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:32,243 INFO L93 Difference]: Finished difference Result 416 states and 557 transitions. [2024-10-14 03:07:32,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:07:32,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-10-14 03:07:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:32,250 INFO L225 Difference]: With dead ends: 416 [2024-10-14 03:07:32,250 INFO L226 Difference]: Without dead ends: 230 [2024-10-14 03:07:32,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:07:32,251 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:32,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 181 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:07:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-14 03:07:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-10-14 03:07:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 178 states have internal predecessors, (221), 32 states have call successors, (32), 26 states have call predecessors, (32), 32 states have return successors, (46), 33 states have call predecessors, (46), 32 states have call successors, (46) [2024-10-14 03:07:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 299 transitions. [2024-10-14 03:07:32,273 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 299 transitions. Word has length 32 [2024-10-14 03:07:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:32,274 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 299 transitions. [2024-10-14 03:07:32,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:07:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 299 transitions. [2024-10-14 03:07:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 03:07:32,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:32,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:32,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:07:32,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:32,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:32,276 INFO L85 PathProgramCache]: Analyzing trace with hash 74735447, now seen corresponding path program 1 times [2024-10-14 03:07:32,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:32,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499782363] [2024-10-14 03:07:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:32,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:07:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499782363] [2024-10-14 03:07:32,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499782363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:32,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:32,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:07:32,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094202317] [2024-10-14 03:07:32,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:32,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:07:32,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:32,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:07:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:07:32,348 INFO L87 Difference]: Start difference. First operand 228 states and 299 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:07:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:32,459 INFO L93 Difference]: Finished difference Result 460 states and 619 transitions. [2024-10-14 03:07:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:07:32,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-10-14 03:07:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:32,461 INFO L225 Difference]: With dead ends: 460 [2024-10-14 03:07:32,462 INFO L226 Difference]: Without dead ends: 234 [2024-10-14 03:07:32,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:07:32,463 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:32,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 178 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:07:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-14 03:07:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2024-10-14 03:07:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 167 states have (on average 1.347305389221557) internal successors, (225), 182 states have internal predecessors, (225), 32 states have call successors, (32), 26 states have call predecessors, (32), 32 states have return successors, (46), 33 states have call predecessors, (46), 32 states have call successors, (46) [2024-10-14 03:07:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 303 transitions. [2024-10-14 03:07:32,495 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 303 transitions. Word has length 32 [2024-10-14 03:07:32,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:32,495 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 303 transitions. [2024-10-14 03:07:32,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:07:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 303 transitions. [2024-10-14 03:07:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 03:07:32,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:32,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:32,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:07:32,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:32,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -946332907, now seen corresponding path program 1 times [2024-10-14 03:07:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:32,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265131299] [2024-10-14 03:07:32,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:07:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:32,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:32,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265131299] [2024-10-14 03:07:32,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265131299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:32,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:32,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:07:32,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106394161] [2024-10-14 03:07:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:32,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:07:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:32,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:07:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:07:32,561 INFO L87 Difference]: Start difference. First operand 232 states and 303 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:07:32,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:32,817 INFO L93 Difference]: Finished difference Result 765 states and 1073 transitions. [2024-10-14 03:07:32,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:07:32,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-10-14 03:07:32,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:32,820 INFO L225 Difference]: With dead ends: 765 [2024-10-14 03:07:32,822 INFO L226 Difference]: Without dead ends: 535 [2024-10-14 03:07:32,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:07:32,824 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 176 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:32,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 269 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:07:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-14 03:07:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 527. [2024-10-14 03:07:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 378 states have (on average 1.335978835978836) internal successors, (505), 407 states have internal predecessors, (505), 78 states have call successors, (78), 71 states have call predecessors, (78), 70 states have return successors, (128), 72 states have call predecessors, (128), 78 states have call successors, (128) [2024-10-14 03:07:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 711 transitions. [2024-10-14 03:07:32,875 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 711 transitions. Word has length 32 [2024-10-14 03:07:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:32,875 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 711 transitions. [2024-10-14 03:07:32,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:07:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 711 transitions. [2024-10-14 03:07:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 03:07:32,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:32,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:32,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:07:32,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:32,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash -581154885, now seen corresponding path program 1 times [2024-10-14 03:07:32,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:32,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133629492] [2024-10-14 03:07:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:32,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:07:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:07:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:07:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:32,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133629492] [2024-10-14 03:07:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133629492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:32,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:07:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961236928] [2024-10-14 03:07:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:32,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:07:32,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:07:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:07:32,994 INFO L87 Difference]: Start difference. First operand 527 states and 711 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:07:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:33,371 INFO L93 Difference]: Finished difference Result 1756 states and 2466 transitions. [2024-10-14 03:07:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:07:33,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-14 03:07:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:33,376 INFO L225 Difference]: With dead ends: 1756 [2024-10-14 03:07:33,377 INFO L226 Difference]: Without dead ends: 1231 [2024-10-14 03:07:33,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-14 03:07:33,379 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 245 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:33,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 261 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:07:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-10-14 03:07:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1225. [2024-10-14 03:07:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 872 states have (on average 1.2855504587155964) internal successors, (1121), 945 states have internal predecessors, (1121), 192 states have call successors, (192), 142 states have call predecessors, (192), 160 states have return successors, (348), 184 states have call predecessors, (348), 192 states have call successors, (348) [2024-10-14 03:07:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1661 transitions. [2024-10-14 03:07:33,453 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1661 transitions. Word has length 36 [2024-10-14 03:07:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:33,453 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1661 transitions. [2024-10-14 03:07:33,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:07:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1661 transitions. [2024-10-14 03:07:33,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 03:07:33,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:33,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:33,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:07:33,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:33,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:33,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1389328287, now seen corresponding path program 1 times [2024-10-14 03:07:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:33,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742060996] [2024-10-14 03:07:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:33,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:07:33,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:07:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:07:33,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:07:33,492 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:07:33,493 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:07:33,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:07:33,496 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:33,534 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:07:33,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:07:33 BoogieIcfgContainer [2024-10-14 03:07:33,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:07:33,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:07:33,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:07:33,539 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:07:33,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:07:31" (3/4) ... [2024-10-14 03:07:33,540 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:07:33,594 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:07:33,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:07:33,597 INFO L158 Benchmark]: Toolchain (without parser) took 3402.53ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 86.9MB in the beginning and 152.6MB in the end (delta: -65.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:07:33,597 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 142.6MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:07:33,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.37ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 112.0MB in the end (delta: -25.4MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-14 03:07:33,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.02ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 112.0MB in the beginning and 176.2MB in the end (delta: -64.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:07:33,597 INFO L158 Benchmark]: Boogie Preprocessor took 32.60ms. Allocated memory is still 205.5MB. Free memory was 176.2MB in the beginning and 174.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:07:33,598 INFO L158 Benchmark]: RCFGBuilder took 436.91ms. Allocated memory is still 205.5MB. Free memory was 174.1MB in the beginning and 150.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 03:07:33,598 INFO L158 Benchmark]: TraceAbstraction took 2452.41ms. Allocated memory is still 205.5MB. Free memory was 149.0MB in the beginning and 156.8MB in the end (delta: -7.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:07:33,598 INFO L158 Benchmark]: Witness Printer took 58.26ms. Allocated memory is still 205.5MB. Free memory was 156.8MB in the beginning and 152.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 03:07:33,599 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 142.6MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.37ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 112.0MB in the end (delta: -25.4MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.02ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 112.0MB in the beginning and 176.2MB in the end (delta: -64.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.60ms. Allocated memory is still 205.5MB. Free memory was 176.2MB in the beginning and 174.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.91ms. Allocated memory is still 205.5MB. Free memory was 174.1MB in the beginning and 150.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2452.41ms. Allocated memory is still 205.5MB. Free memory was 149.0MB in the beginning and 156.8MB in the end (delta: -7.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 58.26ms. Allocated memory is still 205.5MB. Free memory was 156.8MB in the beginning and 152.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [343] - GenericResultAtLocation [Line: 709]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [709] - GenericResultAtLocation [Line: 718]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [718] - GenericResultAtLocation [Line: 756]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [756] - GenericResultAtLocation [Line: 782]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [782] - GenericResultAtLocation [Line: 878]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [878] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 714]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L131] int pumpRunning = 0; [L132] int systemActive = 1; [L513] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L783] int cleanupTimeShifts = 4; [L880] int waterLevel = 1; [L881] int methaneLevelCritical = 0; [L856] int retValue_acc ; [L857] int tmp ; [L861] FCALL select_helpers() [L862] FCALL select_features() [L863] CALL, EXPR valid_product() [L748] int retValue_acc ; [L751] retValue_acc = 1 [L752] return (retValue_acc); [L863] RET, EXPR valid_product() [L863] tmp = valid_product() [L865] COND TRUE \read(tmp) [L867] FCALL setup() [L868] CALL runTest() [L850] CALL test() [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 [L73] tmp = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L77] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L898] COND TRUE waterLevel < 2 [L899] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L77] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L87] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L910] COND FALSE !(\read(methaneLevelCritical)) [L913] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L87] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L110] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L139] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L146] COND TRUE \read(systemActive) [L148] CALL processEnvironment() [L194] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L197] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L212] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L168] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L171] COND TRUE ! pumpRunning [L173] CALL, EXPR isHighWaterLevel() [L291] int retValue_acc ; [L292] int tmp ; [L293] int tmp___0 ; [L297] CALL, EXPR isHighWaterSensorDry() [L960] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L963] COND FALSE !(waterLevel < 2) [L967] retValue_acc = 0 [L968] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L297] RET, EXPR isHighWaterSensorDry() [L297] tmp = isHighWaterSensorDry() [L299] COND FALSE !(\read(tmp)) [L302] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L304] retValue_acc = tmp___0 [L305] return (retValue_acc); [L173] RET, EXPR isHighWaterLevel() [L173] tmp = isHighWaterLevel() [L175] COND TRUE \read(tmp) [L177] CALL activatePump() [L222] pumpRunning = 1 [L177] RET activatePump() [L212] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L148] RET processEnvironment() [L154] CALL __utac_acc__Specification1_spec__1() [L758] int tmp ; [L759] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L763] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L919] int retValue_acc ; [L922] retValue_acc = methaneLevelCritical [L923] return (retValue_acc); [L763] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L763] tmp = isMethaneLevelCritical() [L765] COND TRUE \read(tmp) [L767] CALL, EXPR isPumpRunning() [L246] int retValue_acc ; [L249] retValue_acc = pumpRunning [L250] return (retValue_acc); [L767] RET, EXPR isPumpRunning() [L767] tmp___0 = isPumpRunning() [L769] COND TRUE \read(tmp___0) [L771] CALL __automaton_fail() [L714] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 1423 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 851 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 572 mSDtfsCounter, 886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1225occurred in iteration=8, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 03:07:33,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE