./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product37.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product37.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aad1ec08d8a193b38b6e11f9698a2d5cafe1e5bac6d0d3a9987fa93ed6006219 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:00:24,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:00:24,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:00:24,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:00:24,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:00:24,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:00:24,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:00:24,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:00:24,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:00:24,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:00:24,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:00:24,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:00:24,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:00:24,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:00:24,620 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:00:24,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:00:24,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:00:24,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:00:24,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:00:24,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:00:24,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:00:24,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:00:24,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:24,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:00:24,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:00:24,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:00:24,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:00:24,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:24,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:00:24,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:00:24,623 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:00:24,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:00:24,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:00:24,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:00:24,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:00:24,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:00:24,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:00:24,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:00:24,624 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> aad1ec08d8a193b38b6e11f9698a2d5cafe1e5bac6d0d3a9987fa93ed6006219 [2025-01-09 04:00:24,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:00:24,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:00:24,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:00:24,845 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:00:24,846 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:00:24,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product37.cil.c [2025-01-09 04:00:26,090 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4bea7073/8d1657618cdb4af1ac4a693c011eb281/FLAG0a3deefef [2025-01-09 04:00:26,387 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:00:26,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product37.cil.c [2025-01-09 04:00:26,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4bea7073/8d1657618cdb4af1ac4a693c011eb281/FLAG0a3deefef [2025-01-09 04:00:26,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4bea7073/8d1657618cdb4af1ac4a693c011eb281 [2025-01-09 04:00:26,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:00:26,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:00:26,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:00:26,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:00:26,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:00:26,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:26" (1/1) ... [2025-01-09 04:00:26,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5766f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:26, skipping insertion in model container [2025-01-09 04:00:26,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:26" (1/1) ... [2025-01-09 04:00:26,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:00:26,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product37.cil.c[7021,7034] [2025-01-09 04:00:27,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:00:27,062 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:00:27,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [49] [2025-01-09 04:00:27,077 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [237] [2025-01-09 04:00:27,078 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [305] [2025-01-09 04:00:27,078 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [345] [2025-01-09 04:00:27,078 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [440] [2025-01-09 04:00:27,079 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [449] [2025-01-09 04:00:27,079 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [815] [2025-01-09 04:00:27,079 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [915] [2025-01-09 04:00:27,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product37.cil.c[7021,7034] [2025-01-09 04:00:27,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:00:27,168 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:00:27,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27 WrapperNode [2025-01-09 04:00:27,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:00:27,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:00:27,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:00:27,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:00:27,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,216 INFO L138 Inliner]: procedures = 54, calls = 98, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 191 [2025-01-09 04:00:27,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:00:27,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:00:27,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:00:27,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:00:27,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,248 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]. [2025-01-09 04:00:27,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:00:27,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:00:27,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:00:27,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:00:27,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (1/1) ... [2025-01-09 04:00:27,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:27,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:27,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:00:27,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:00:27,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:00:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:00:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:00:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:00:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:00:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-01-09 04:00:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-01-09 04:00:27,344 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:00:27,344 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:00:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:00:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:00:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:00:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:00:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:00:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:00:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:00:27,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:00:27,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:00:27,413 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:00:27,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:00:27,668 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-01-09 04:00:27,672 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:00:27,685 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:00:27,690 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:00:27,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:27 BoogieIcfgContainer [2025-01-09 04:00:27,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:00:27,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:00:27,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:00:27,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:00:27,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:00:26" (1/3) ... [2025-01-09 04:00:27,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e32f56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:27, skipping insertion in model container [2025-01-09 04:00:27,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:27" (2/3) ... [2025-01-09 04:00:27,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e32f56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:27, skipping insertion in model container [2025-01-09 04:00:27,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:27" (3/3) ... [2025-01-09 04:00:27,699 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product37.cil.c [2025-01-09 04:00:27,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:00:27,712 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product37.cil.c that has 8 procedures, 85 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:00:27,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:00:27,754 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;@21089d9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:00:27,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:00:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 64 states have (on average 1.375) internal successors, (88), 72 states have internal predecessors, (88), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 04:00:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:00:27,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:27,763 INFO L218 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] [2025-01-09 04:00:27,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:27,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash 684628979, now seen corresponding path program 1 times [2025-01-09 04:00:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:27,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973030936] [2025-01-09 04:00:27,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:27,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:27,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:00:27,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:00:27,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:27,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:27,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:27,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973030936] [2025-01-09 04:00:27,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973030936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:27,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:27,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:27,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305034616] [2025-01-09 04:00:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:27,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:27,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:27,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:27,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:27,937 INFO L87 Difference]: Start difference. First operand has 85 states, 64 states have (on average 1.375) internal successors, (88), 72 states have internal predecessors, (88), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-09 04:00:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:27,958 INFO L93 Difference]: Finished difference Result 149 states and 199 transitions. [2025-01-09 04:00:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:27,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 25 [2025-01-09 04:00:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:27,964 INFO L225 Difference]: With dead ends: 149 [2025-01-09 04:00:27,965 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 04:00:27,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:27,978 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:27,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 04:00:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-09 04:00:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 59 states have internal predecessors, (70), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 04:00:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2025-01-09 04:00:28,044 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 25 [2025-01-09 04:00:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:28,044 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2025-01-09 04:00:28,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-09 04:00:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2025-01-09 04:00:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:00:28,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:28,050 INFO L218 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] [2025-01-09 04:00:28,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:00:28,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:28,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1613227248, now seen corresponding path program 1 times [2025-01-09 04:00:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:28,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383112206] [2025-01-09 04:00:28,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:28,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:00:28,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:00:28,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383112206] [2025-01-09 04:00:28,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383112206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:28,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:28,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:00:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463839112] [2025-01-09 04:00:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:28,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:28,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:28,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:28,204 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2025-01-09 04:00:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:28,343 INFO L93 Difference]: Finished difference Result 128 states and 169 transitions. [2025-01-09 04:00:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:00:28,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 29 [2025-01-09 04:00:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:28,345 INFO L225 Difference]: With dead ends: 128 [2025-01-09 04:00:28,345 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 04:00:28,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:00:28,346 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 84 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:28,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 212 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 04:00:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-09 04:00:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 59 states have internal predecessors, (69), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 04:00:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2025-01-09 04:00:28,366 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 29 [2025-01-09 04:00:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:28,370 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2025-01-09 04:00:28,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2025-01-09 04:00:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2025-01-09 04:00:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 04:00:28,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:28,371 INFO L218 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] [2025-01-09 04:00:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:00:28,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2120300718, now seen corresponding path program 1 times [2025-01-09 04:00:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911020495] [2025-01-09 04:00:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:28,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 04:00:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 04:00:28,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:28,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911020495] [2025-01-09 04:00:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911020495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:28,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:00:28,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170128672] [2025-01-09 04:00:28,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:28,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:28,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:28,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:28,487 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:00:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:28,704 INFO L93 Difference]: Finished difference Result 201 states and 259 transitions. [2025-01-09 04:00:28,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:28,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2025-01-09 04:00:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:28,705 INFO L225 Difference]: With dead ends: 201 [2025-01-09 04:00:28,705 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 04:00:28,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:00:28,706 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 176 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:28,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 273 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:00:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 04:00:28,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2025-01-09 04:00:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 110 states have internal predecessors, (133), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-01-09 04:00:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 168 transitions. [2025-01-09 04:00:28,724 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 168 transitions. Word has length 39 [2025-01-09 04:00:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:28,724 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 168 transitions. [2025-01-09 04:00:28,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:00:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 168 transitions. [2025-01-09 04:00:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 04:00:28,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:28,725 INFO L218 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, 1, 1, 1] [2025-01-09 04:00:28,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:00:28,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:28,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:28,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1077569170, now seen corresponding path program 1 times [2025-01-09 04:00:28,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:28,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959300760] [2025-01-09 04:00:28,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:28,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:28,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 04:00:28,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 04:00:28,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:28,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:28,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:28,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959300760] [2025-01-09 04:00:28,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959300760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:28,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:28,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:00:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919785523] [2025-01-09 04:00:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:28,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:28,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:28,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:28,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:28,802 INFO L87 Difference]: Start difference. First operand 135 states and 168 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:00:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:28,824 INFO L93 Difference]: Finished difference Result 265 states and 335 transitions. [2025-01-09 04:00:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:00:28,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 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 43 [2025-01-09 04:00:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:28,825 INFO L225 Difference]: With dead ends: 265 [2025-01-09 04:00:28,825 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 04:00:28,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:28,827 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:28,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 04:00:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-01-09 04:00:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 113 states have internal predecessors, (136), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-01-09 04:00:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2025-01-09 04:00:28,837 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 43 [2025-01-09 04:00:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:28,837 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2025-01-09 04:00:28,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:00:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2025-01-09 04:00:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 04:00:28,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:28,838 INFO L218 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, 1, 1, 1] [2025-01-09 04:00:28,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:00:28,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:28,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1528454384, now seen corresponding path program 1 times [2025-01-09 04:00:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626743845] [2025-01-09 04:00:28,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:28,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 04:00:28,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 04:00:28,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:28,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:28,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:28,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626743845] [2025-01-09 04:00:28,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626743845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:28,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:28,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:00:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273553] [2025-01-09 04:00:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:28,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:28,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:28,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:28,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:28,923 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:00:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:28,946 INFO L93 Difference]: Finished difference Result 270 states and 343 transitions. [2025-01-09 04:00:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:00:28,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (3), 1 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 43 [2025-01-09 04:00:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:28,947 INFO L225 Difference]: With dead ends: 270 [2025-01-09 04:00:28,947 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 04:00:28,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:28,948 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:28,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 407 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 04:00:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-01-09 04:00:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 115 states have internal predecessors, (138), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-01-09 04:00:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2025-01-09 04:00:28,958 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 43 [2025-01-09 04:00:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:28,958 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2025-01-09 04:00:28,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:00:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2025-01-09 04:00:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 04:00:28,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:28,963 INFO L218 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, 1, 1, 1] [2025-01-09 04:00:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:00:28,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1951156210, now seen corresponding path program 1 times [2025-01-09 04:00:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:28,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649975224] [2025-01-09 04:00:28,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:28,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 04:00:28,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 04:00:28,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:28,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649975224] [2025-01-09 04:00:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649975224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:29,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:00:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172545935] [2025-01-09 04:00:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:29,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:00:29,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:29,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:00:29,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:00:29,091 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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) [2025-01-09 04:00:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:29,177 INFO L93 Difference]: Finished difference Result 430 states and 552 transitions. [2025-01-09 04:00:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:00:29,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 43 [2025-01-09 04:00:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:29,180 INFO L225 Difference]: With dead ends: 430 [2025-01-09 04:00:29,182 INFO L226 Difference]: Without dead ends: 298 [2025-01-09 04:00:29,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:00:29,183 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 116 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:29,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 287 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-09 04:00:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 188. [2025-01-09 04:00:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 153 states have internal predecessors, (182), 21 states have call successors, (21), 19 states have call predecessors, (21), 22 states have return successors, (27), 21 states have call predecessors, (27), 21 states have call successors, (27) [2025-01-09 04:00:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2025-01-09 04:00:29,215 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 43 [2025-01-09 04:00:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:29,215 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2025-01-09 04:00:29,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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) [2025-01-09 04:00:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2025-01-09 04:00:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:00:29,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:29,219 INFO L218 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, 1, 1, 1, 1, 1] [2025-01-09 04:00:29,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:00:29,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:29,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash -278713990, now seen corresponding path program 1 times [2025-01-09 04:00:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:29,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445312971] [2025-01-09 04:00:29,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:29,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:00:29,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:00:29,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:29,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:29,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445312971] [2025-01-09 04:00:29,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445312971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:29,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:29,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:00:29,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193850228] [2025-01-09 04:00:29,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:29,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:29,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:29,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:29,291 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:00:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:29,460 INFO L93 Difference]: Finished difference Result 367 states and 451 transitions. [2025-01-09 04:00:29,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:00:29,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-01-09 04:00:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:29,464 INFO L225 Difference]: With dead ends: 367 [2025-01-09 04:00:29,464 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 04:00:29,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:00:29,465 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 112 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:29,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 281 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 04:00:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-01-09 04:00:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 150 states have internal predecessors, (173), 21 states have call successors, (21), 19 states have call predecessors, (21), 22 states have return successors, (27), 21 states have call predecessors, (27), 21 states have call successors, (27) [2025-01-09 04:00:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2025-01-09 04:00:29,479 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 45 [2025-01-09 04:00:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:29,480 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2025-01-09 04:00:29,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:00:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2025-01-09 04:00:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:00:29,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:29,481 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:29,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:00:29,481 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1302133772, now seen corresponding path program 1 times [2025-01-09 04:00:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:29,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820434153] [2025-01-09 04:00:29,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:29,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:00:29,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:00:29,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:29,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:29,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:29,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820434153] [2025-01-09 04:00:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820434153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:29,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:29,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050332884] [2025-01-09 04:00:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:29,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:29,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:29,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:29,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:29,520 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:00:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:29,550 INFO L93 Difference]: Finished difference Result 291 states and 355 transitions. [2025-01-09 04:00:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:29,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-01-09 04:00:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:29,553 INFO L225 Difference]: With dead ends: 291 [2025-01-09 04:00:29,553 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 04:00:29,553 INFO L434 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 [2025-01-09 04:00:29,554 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 60 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:29,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 04:00:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 271. [2025-01-09 04:00:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 206 states have (on average 1.233009708737864) internal successors, (254), 219 states have internal predecessors, (254), 31 states have call successors, (31), 28 states have call predecessors, (31), 33 states have return successors, (46), 31 states have call predecessors, (46), 31 states have call successors, (46) [2025-01-09 04:00:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 331 transitions. [2025-01-09 04:00:29,594 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 331 transitions. Word has length 47 [2025-01-09 04:00:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:29,594 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 331 transitions. [2025-01-09 04:00:29,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:00:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 331 transitions. [2025-01-09 04:00:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:00:29,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:29,614 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:29,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:00:29,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:29,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1121487016, now seen corresponding path program 1 times [2025-01-09 04:00:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:29,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204160642] [2025-01-09 04:00:29,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:29,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:29,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:00:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:00:29,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:29,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 04:00:29,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:29,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204160642] [2025-01-09 04:00:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204160642] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:29,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399289065] [2025-01-09 04:00:29,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:29,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:29,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:29,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:00:29,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:00:29,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:00:29,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:00:29,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:29,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:29,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 04:00:29,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:29,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:00:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399289065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:00:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 04:00:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143054612] [2025-01-09 04:00:29,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:29,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:29,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:29,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:29,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:00:29,884 INFO L87 Difference]: Start difference. First operand 271 states and 331 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 04:00:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:29,916 INFO L93 Difference]: Finished difference Result 454 states and 561 transitions. [2025-01-09 04:00:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:29,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2025-01-09 04:00:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:29,918 INFO L225 Difference]: With dead ends: 454 [2025-01-09 04:00:29,918 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 04:00:29,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:00:29,919 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 37 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:29,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 187 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 04:00:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-01-09 04:00:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.2247191011235956) internal successors, (218), 190 states have internal predecessors, (218), 28 states have call successors, (28), 25 states have call predecessors, (28), 29 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2025-01-09 04:00:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 282 transitions. [2025-01-09 04:00:29,936 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 282 transitions. Word has length 84 [2025-01-09 04:00:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:29,936 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 282 transitions. [2025-01-09 04:00:29,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 04:00:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 282 transitions. [2025-01-09 04:00:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:00:29,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:29,938 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:29,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:00:30,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:30,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:30,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash 412019866, now seen corresponding path program 1 times [2025-01-09 04:00:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585629798] [2025-01-09 04:00:30,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:30,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:00:30,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:00:30,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:30,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:00:30,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:30,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585629798] [2025-01-09 04:00:30,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585629798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:30,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301677642] [2025-01-09 04:00:30,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:30,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:30,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:30,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:00:30,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:00:30,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:00:30,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:00:30,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:30,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:30,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 04:00:30,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 04:00:30,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:00:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:00:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301677642] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:30,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:00:30,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 10 [2025-01-09 04:00:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289400853] [2025-01-09 04:00:30,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:30,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:30,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:30,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:00:30,552 INFO L87 Difference]: Start difference. First operand 236 states and 282 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:00:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:30,647 INFO L93 Difference]: Finished difference Result 658 states and 804 transitions. [2025-01-09 04:00:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:30,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 89 [2025-01-09 04:00:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:30,650 INFO L225 Difference]: With dead ends: 658 [2025-01-09 04:00:30,650 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 04:00:30,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:00:30,651 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 47 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:30,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 384 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 04:00:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 401. [2025-01-09 04:00:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 299 states have (on average 1.1973244147157192) internal successors, (358), 320 states have internal predecessors, (358), 49 states have call successors, (49), 44 states have call predecessors, (49), 52 states have return successors, (65), 49 states have call predecessors, (65), 49 states have call successors, (65) [2025-01-09 04:00:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 472 transitions. [2025-01-09 04:00:30,678 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 472 transitions. Word has length 89 [2025-01-09 04:00:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:30,678 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 472 transitions. [2025-01-09 04:00:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:00:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 472 transitions. [2025-01-09 04:00:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:00:30,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:30,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:30,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:00:30,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:30,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:30,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1568842058, now seen corresponding path program 1 times [2025-01-09 04:00:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:30,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590181460] [2025-01-09 04:00:30,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:30,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:00:30,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:00:30,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:30,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:00:30,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590181460] [2025-01-09 04:00:30,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590181460] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125792927] [2025-01-09 04:00:30,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:30,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:30,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:30,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:00:30,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:00:31,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:00:31,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:00:31,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:31,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:31,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:00:31,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:00:31,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:00:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125792927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:00:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-01-09 04:00:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061464932] [2025-01-09 04:00:31,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:31,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:00:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:31,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:00:31,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:00:31,185 INFO L87 Difference]: Start difference. First operand 401 states and 472 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:00:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:31,286 INFO L93 Difference]: Finished difference Result 752 states and 891 transitions. [2025-01-09 04:00:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:31,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 93 [2025-01-09 04:00:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:31,288 INFO L225 Difference]: With dead ends: 752 [2025-01-09 04:00:31,288 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:00:31,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:00:31,290 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 24 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:31,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 757 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:00:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:00:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:00:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:00:31,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2025-01-09 04:00:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:31,292 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:00:31,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:00:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:00:31,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:00:31,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:00:31,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:00:31,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:31,501 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:31,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:00:34,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:00:34,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:00:34 BoogieIcfgContainer [2025-01-09 04:00:34,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:00:34,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:00:34,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:00:34,621 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:00:34,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:27" (3/4) ... [2025-01-09 04:00:34,624 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:00:34,631 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:00:34,634 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:00:34,634 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:00:34,634 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-01-09 04:00:34,634 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:00:34,635 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:00:34,635 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:00:34,638 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-09 04:00:34,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:00:34,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:00:34,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:00:34,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:00:34,720 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:00:34,721 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:00:34,721 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:00:34,722 INFO L158 Benchmark]: Toolchain (without parser) took 8046.79ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.4MB in the beginning and 109.1MB in the end (delta: 13.3MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-01-09 04:00:34,723 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:00:34,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.07ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 103.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:00:34,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.06ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 102.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:00:34,723 INFO L158 Benchmark]: Boogie Preprocessor took 45.71ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:00:34,724 INFO L158 Benchmark]: RCFGBuilder took 424.42ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 83.7MB in the end (delta: 16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:00:34,725 INFO L158 Benchmark]: TraceAbstraction took 6927.70ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 83.2MB in the beginning and 115.3MB in the end (delta: -32.1MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2025-01-09 04:00:34,725 INFO L158 Benchmark]: Witness Printer took 100.09ms. Allocated memory is still 201.3MB. Free memory was 115.3MB in the beginning and 109.1MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:00:34,726 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.13ms. Allocated memory is still 209.7MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.07ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 103.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.06ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 102.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.71ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 424.42ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 83.7MB in the end (delta: 16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6927.70ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 83.2MB in the beginning and 115.3MB in the end (delta: -32.1MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Witness Printer took 100.09ms. Allocated memory is still 201.3MB. Free memory was 115.3MB in the beginning and 109.1MB in the end (delta: 6.2MB). There was no memory consumed. 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,"MinePump.i","") [49] - GenericResultAtLocation [Line: 237]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [237] - GenericResultAtLocation [Line: 305]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [305] - GenericResultAtLocation [Line: 345]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [345] - GenericResultAtLocation [Line: 440]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [440] - GenericResultAtLocation [Line: 449]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [449] - GenericResultAtLocation [Line: 815]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [815] - GenericResultAtLocation [Line: 915]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [915] * 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 - PositiveResult [Line: 445]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 680 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 668 mSDsluCounter, 3446 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2339 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 492 IncrementalHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 1107 mSDtfsCounter, 492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=401occurred in iteration=10, InterpolantAutomatonStates: 59, 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, 11 MinimizatonAttempts, 165 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 846 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 1770 SizeOfPredicates, 3 NumberOfNonLiveVariables, 916 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 217/228 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 827]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 297]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-01-09 04:00:34,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Result: TRUE