./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product53.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_product53.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 1f55fffdfb523946c08e4798dfd7a981dcf70594f408e958cce4b1b6e97bd924 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:00:38,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:00:38,256 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:38,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:00:38,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:00:38,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:00:38,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:00:38,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:00:38,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:00:38,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:00:38,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:00:38,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:00:38,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:00:38,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:00:38,275 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:00:38,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:00:38,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:00:38,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:00:38,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:00:38,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:00:38,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:00:38,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:00:38,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:00:38,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:38,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:00:38,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:00:38,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:38,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:00:38,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:00:38,279 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 -> 1f55fffdfb523946c08e4798dfd7a981dcf70594f408e958cce4b1b6e97bd924 [2025-01-09 04:00:38,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:00:38,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:00:38,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:00:38,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:00:38,470 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:00:38,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product53.cil.c [2025-01-09 04:00:39,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/217cb4efa/f6f20c464b5146aea42af89c4597bc58/FLAG7dd55c734 [2025-01-09 04:00:39,931 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:00:39,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product53.cil.c [2025-01-09 04:00:39,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/217cb4efa/f6f20c464b5146aea42af89c4597bc58/FLAG7dd55c734 [2025-01-09 04:00:40,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/217cb4efa/f6f20c464b5146aea42af89c4597bc58 [2025-01-09 04:00:40,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:00:40,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:00:40,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:00:40,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:00:40,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:00:40,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:40" (1/1) ... [2025-01-09 04:00:40,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535217bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:40, skipping insertion in model container [2025-01-09 04:00:40,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:40" (1/1) ... [2025-01-09 04:00:40,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:00:40,342 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_product53.cil.c[1605,1618] [2025-01-09 04:00:40,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:00:40,451 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:00:40,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2025-01-09 04:00:40,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [58] [2025-01-09 04:00:40,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [127] [2025-01-09 04:00:40,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [493] [2025-01-09 04:00:40,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [726] [2025-01-09 04:00:40,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [765] [2025-01-09 04:00:40,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [865] [2025-01-09 04:00:40,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [969] [2025-01-09 04:00:40,463 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_product53.cil.c[1605,1618] [2025-01-09 04:00:40,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:00:40,532 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:00:40,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:40 WrapperNode [2025-01-09 04:00:40,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:00:40,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:00:40,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:00:40,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:00:40,541 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:40" (1/1) ... [2025-01-09 04:00:40,548 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:40" (1/1) ... [2025-01-09 04:00:40,566 INFO L138 Inliner]: procedures = 57, calls = 103, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 221 [2025-01-09 04:00:40,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:00:40,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:00:40,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:00:40,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:00:40,575 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:40" (1/1) ... [2025-01-09 04:00:40,576 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:40" (1/1) ... [2025-01-09 04:00:40,582 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:40" (1/1) ... [2025-01-09 04:00:40,599 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:40,600 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:40" (1/1) ... [2025-01-09 04:00:40,600 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:40" (1/1) ... [2025-01-09 04:00:40,603 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:40" (1/1) ... [2025-01-09 04:00:40,603 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:40" (1/1) ... [2025-01-09 04:00:40,605 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:40" (1/1) ... [2025-01-09 04:00:40,606 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:40" (1/1) ... [2025-01-09 04:00:40,607 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:40" (1/1) ... [2025-01-09 04:00:40,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:00:40,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:00:40,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:00:40,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:00:40,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:40" (1/1) ... [2025-01-09 04:00:40,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:40,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:40,637 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:40,639 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:40,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:00:40,654 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:00:40,654 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:00:40,654 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-01-09 04:00:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-01-09 04:00:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:00:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:00:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:00:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:00:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:00:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:00:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:00:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:00:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2025-01-09 04:00:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2025-01-09 04:00:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-01-09 04:00:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-01-09 04:00:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:00:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:00:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:00:40,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:00:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:00:40,714 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:00:40,716 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:00:40,964 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-01-09 04:00:40,965 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:00:40,977 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:00:40,977 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:00:40,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:40 BoogieIcfgContainer [2025-01-09 04:00:40,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:00:40,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:00:40,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:00:40,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:00:40,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:00:40" (1/3) ... [2025-01-09 04:00:40,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6852e1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:40, skipping insertion in model container [2025-01-09 04:00:40,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:40" (2/3) ... [2025-01-09 04:00:40,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6852e1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:40, skipping insertion in model container [2025-01-09 04:00:40,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:40" (3/3) ... [2025-01-09 04:00:40,987 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product53.cil.c [2025-01-09 04:00:40,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:00:41,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product53.cil.c that has 10 procedures, 100 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:00:41,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:00:41,055 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;@25d190f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:00:41,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:00:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 states have internal predecessors, (100), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 04:00:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:00:41,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:41,067 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:41,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:41,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1552994014, now seen corresponding path program 1 times [2025-01-09 04:00:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115799558] [2025-01-09 04:00:41,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:41,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:41,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:00:41,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:00:41,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:41,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:41,295 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:41,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115799558] [2025-01-09 04:00:41,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115799558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:41,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:41,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391102361] [2025-01-09 04:00:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:41,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:41,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:41,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:41,320 INFO L87 Difference]: Start difference. First operand has 100 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 states have internal predecessors, (100), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) 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:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:41,347 INFO L93 Difference]: Finished difference Result 179 states and 239 transitions. [2025-01-09 04:00:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:41,349 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:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:41,355 INFO L225 Difference]: With dead ends: 179 [2025-01-09 04:00:41,359 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 04:00:41,365 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:41,371 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 207 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:41,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 207 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:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 04:00:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 04:00:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 70 states have internal predecessors, (82), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 04:00:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2025-01-09 04:00:41,419 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 25 [2025-01-09 04:00:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:41,419 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-01-09 04:00:41,419 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:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2025-01-09 04:00:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:00:41,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:41,424 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:41,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:00:41,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:41,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash 809942004, now seen corresponding path program 1 times [2025-01-09 04:00:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:41,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610596039] [2025-01-09 04:00:41,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:41,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:00:41,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:00:41,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:41,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:41,539 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:41,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:41,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610596039] [2025-01-09 04:00:41,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610596039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:41,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:41,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544258272] [2025-01-09 04:00:41,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:41,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:41,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:41,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:41,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:41,541 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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:41,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:41,554 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2025-01-09 04:00:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:41,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:41,555 INFO L225 Difference]: With dead ends: 158 [2025-01-09 04:00:41,555 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 04:00:41,556 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:41,556 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 106 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:41,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 106 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:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 04:00:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 04:00:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 70 states have internal predecessors, (81), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 04:00:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2025-01-09 04:00:41,564 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 29 [2025-01-09 04:00:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:41,564 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2025-01-09 04:00:41,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2025-01-09 04:00:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:00:41,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:41,565 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:00:41,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:00:41,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:41,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1485974121, now seen corresponding path program 1 times [2025-01-09 04:00:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:41,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222093501] [2025-01-09 04:00:41,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:41,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 04:00:41,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:00:41,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:41,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:00:41,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222093501] [2025-01-09 04:00:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222093501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:41,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:41,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699271084] [2025-01-09 04:00:41,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:41,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:41,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:41,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:41,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:41,624 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 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:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:41,676 INFO L93 Difference]: Finished difference Result 204 states and 272 transitions. [2025-01-09 04:00:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 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 42 [2025-01-09 04:00:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:41,678 INFO L225 Difference]: With dead ends: 204 [2025-01-09 04:00:41,678 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 04:00:41,679 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:41,679 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 61 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:41,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 199 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 04:00:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-01-09 04:00:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 102 states have internal predecessors, (123), 17 states have call successors, (17), 15 states have call predecessors, (17), 15 states have return successors, (23), 15 states have call predecessors, (23), 17 states have call successors, (23) [2025-01-09 04:00:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2025-01-09 04:00:41,704 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 42 [2025-01-09 04:00:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:41,704 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2025-01-09 04:00:41,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 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:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2025-01-09 04:00:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 04:00:41,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:41,705 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, 1] [2025-01-09 04:00:41,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:00:41,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:41,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash 922894300, now seen corresponding path program 1 times [2025-01-09 04:00:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:41,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288454953] [2025-01-09 04:00:41,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:41,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:41,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 04:00:41,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 04:00:41,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:41,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:41,822 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:41,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:41,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288454953] [2025-01-09 04:00:41,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288454953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:41,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:41,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:00:41,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352433639] [2025-01-09 04:00:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:41,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:41,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:41,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:41,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:41,825 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:00:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:41,862 INFO L93 Difference]: Finished difference Result 249 states and 328 transitions. [2025-01-09 04:00:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:00:41,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-01-09 04:00:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:41,864 INFO L225 Difference]: With dead ends: 249 [2025-01-09 04:00:41,864 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 04:00:41,864 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:41,865 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 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:41,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 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:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 04:00:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-09 04:00:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 105 states have internal predecessors, (126), 17 states have call successors, (17), 15 states have call predecessors, (17), 15 states have return successors, (23), 15 states have call predecessors, (23), 17 states have call successors, (23) [2025-01-09 04:00:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2025-01-09 04:00:41,884 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 48 [2025-01-09 04:00:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:41,885 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2025-01-09 04:00:41,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:00:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2025-01-09 04:00:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 04:00:41,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:41,887 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, 1] [2025-01-09 04:00:41,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:00:41,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:41,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1345596126, now seen corresponding path program 1 times [2025-01-09 04:00:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875639810] [2025-01-09 04:00:41,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:41,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 04:00:41,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 04:00:41,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:41,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:41,949 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:41,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875639810] [2025-01-09 04:00:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875639810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:41,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:41,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:00:41,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199467193] [2025-01-09 04:00:41,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:41,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:00:41,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:41,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:00:41,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:00:41,951 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:00:41,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:41,972 INFO L93 Difference]: Finished difference Result 254 states and 339 transitions. [2025-01-09 04:00:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:00:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-01-09 04:00:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:41,973 INFO L225 Difference]: With dead ends: 254 [2025-01-09 04:00:41,973 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 04:00:41,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:41,974 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:41,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 04:00:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-01-09 04:00:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 99 states have (on average 1.292929292929293) internal successors, (128), 107 states have internal predecessors, (128), 17 states have call successors, (17), 15 states have call predecessors, (17), 15 states have return successors, (23), 15 states have call predecessors, (23), 17 states have call successors, (23) [2025-01-09 04:00:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2025-01-09 04:00:41,984 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 48 [2025-01-09 04:00:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:41,984 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2025-01-09 04:00:41,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:00:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2025-01-09 04:00:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 04:00:41,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:41,985 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, 1] [2025-01-09 04:00:41,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:00:41,985 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:41,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash -459842208, now seen corresponding path program 1 times [2025-01-09 04:00:41,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:41,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256472675] [2025-01-09 04:00:41,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:42,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 04:00:42,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 04:00:42,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:42,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:42,065 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:42,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:42,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256472675] [2025-01-09 04:00:42,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256472675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:42,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:42,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:00:42,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462549235] [2025-01-09 04:00:42,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:42,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:00:42,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:42,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:00:42,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:00:42,066 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 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:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:42,182 INFO L93 Difference]: Finished difference Result 427 states and 565 transitions. [2025-01-09 04:00:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:00:42,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 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 48 [2025-01-09 04:00:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:42,184 INFO L225 Difference]: With dead ends: 427 [2025-01-09 04:00:42,185 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 04:00:42,186 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:42,187 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 141 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:42,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 368 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 04:00:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 294. [2025-01-09 04:00:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 218 states have (on average 1.2798165137614679) internal successors, (279), 233 states have internal predecessors, (279), 39 states have call successors, (39), 35 states have call predecessors, (39), 36 states have return successors, (64), 36 states have call predecessors, (64), 39 states have call successors, (64) [2025-01-09 04:00:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 382 transitions. [2025-01-09 04:00:42,221 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 382 transitions. Word has length 48 [2025-01-09 04:00:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:42,225 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 382 transitions. [2025-01-09 04:00:42,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 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:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 382 transitions. [2025-01-09 04:00:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:00:42,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:42,226 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, 1, 1, 1] [2025-01-09 04:00:42,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:00:42,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:42,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:42,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1483539485, now seen corresponding path program 1 times [2025-01-09 04:00:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:42,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087497748] [2025-01-09 04:00:42,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:42,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:00:42,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:00:42,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:42,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:42,357 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:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087497748] [2025-01-09 04:00:42,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087497748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:42,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:42,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:00:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533285659] [2025-01-09 04:00:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:42,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:42,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:42,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:42,360 INFO L87 Difference]: Start difference. First operand 294 states and 382 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:00:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:42,575 INFO L93 Difference]: Finished difference Result 618 states and 811 transitions. [2025-01-09 04:00:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:00:42,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-09 04:00:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:42,578 INFO L225 Difference]: With dead ends: 618 [2025-01-09 04:00:42,578 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 04:00:42,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:00:42,580 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 114 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:42,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 343 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 04:00:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2025-01-09 04:00:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 244 states have (on average 1.2459016393442623) internal successors, (304), 259 states have internal predecessors, (304), 42 states have call successors, (42), 35 states have call predecessors, (42), 43 states have return successors, (77), 45 states have call predecessors, (77), 42 states have call successors, (77) [2025-01-09 04:00:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 423 transitions. [2025-01-09 04:00:42,602 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 423 transitions. Word has length 50 [2025-01-09 04:00:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:42,603 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 423 transitions. [2025-01-09 04:00:42,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:00:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 423 transitions. [2025-01-09 04:00:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:00:42,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:42,604 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, 1, 1, 1, 1, 1] [2025-01-09 04:00:42,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:00:42,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:42,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash -151026042, now seen corresponding path program 1 times [2025-01-09 04:00:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675923530] [2025-01-09 04:00:42,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:42,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:00:42,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:00:42,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:42,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:42,673 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:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:42,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675923530] [2025-01-09 04:00:42,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675923530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:42,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:42,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570419216] [2025-01-09 04:00:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:42,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:42,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:42,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:42,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:42,676 INFO L87 Difference]: Start difference. First operand 330 states and 423 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:00:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:42,737 INFO L93 Difference]: Finished difference Result 556 states and 737 transitions. [2025-01-09 04:00:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:42,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2025-01-09 04:00:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:42,741 INFO L225 Difference]: With dead ends: 556 [2025-01-09 04:00:42,741 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 04:00:42,741 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:42,744 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 80 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 202 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:42,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 202 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:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 04:00:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 520. [2025-01-09 04:00:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 381 states have (on average 1.2519685039370079) internal successors, (477), 407 states have internal predecessors, (477), 68 states have call successors, (68), 56 states have call predecessors, (68), 70 states have return successors, (148), 70 states have call predecessors, (148), 68 states have call successors, (148) [2025-01-09 04:00:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 693 transitions. [2025-01-09 04:00:42,798 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 693 transitions. Word has length 52 [2025-01-09 04:00:42,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:42,799 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 693 transitions. [2025-01-09 04:00:42,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:00:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 693 transitions. [2025-01-09 04:00:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:00:42,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:42,802 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, 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] [2025-01-09 04:00:42,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:00:42,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:42,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash -843631232, now seen corresponding path program 1 times [2025-01-09 04:00:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:42,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116199951] [2025-01-09 04:00:42,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:42,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:00:42,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:00:42,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:42,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 04:00:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116199951] [2025-01-09 04:00:42,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116199951] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147748001] [2025-01-09 04:00:42,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:42,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:42,954 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:42,969 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:43,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:00:43,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:00:43,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:43,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:43,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 04:00:43,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:00:43,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:00:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147748001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:43,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:00:43,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-09 04:00:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332753291] [2025-01-09 04:00:43,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:43,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:43,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:43,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:43,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:00:43,115 INFO L87 Difference]: Start difference. First operand 520 states and 693 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:00:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:43,161 INFO L93 Difference]: Finished difference Result 1095 states and 1515 transitions. [2025-01-09 04:00:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2025-01-09 04:00:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:43,164 INFO L225 Difference]: With dead ends: 1095 [2025-01-09 04:00:43,164 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 04:00:43,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 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:43,166 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 73 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:43,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 04:00:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 631. [2025-01-09 04:00:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 463 states have (on average 1.2462203023758098) internal successors, (577), 491 states have internal predecessors, (577), 84 states have call successors, (84), 74 states have call predecessors, (84), 83 states have return successors, (170), 82 states have call predecessors, (170), 84 states have call successors, (170) [2025-01-09 04:00:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 831 transitions. [2025-01-09 04:00:43,242 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 831 transitions. Word has length 103 [2025-01-09 04:00:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:43,243 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 831 transitions. [2025-01-09 04:00:43,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:00:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 831 transitions. [2025-01-09 04:00:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:00:43,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:43,250 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, 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:43,259 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:43,454 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:43,455 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:43,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:43,455 INFO L85 PathProgramCache]: Analyzing trace with hash -549189086, now seen corresponding path program 1 times [2025-01-09 04:00:43,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:43,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928055859] [2025-01-09 04:00:43,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:43,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:00:43,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:00:43,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:43,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 04:00:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928055859] [2025-01-09 04:00:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928055859] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76160318] [2025-01-09 04:00:43,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:43,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:43,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:43,582 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:43,588 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:43,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:00:43,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:00:43,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:43,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:43,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 04:00:43,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:43,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:00:43,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76160318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:43,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:00:43,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 04:00:43,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738210545] [2025-01-09 04:00:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:43,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:43,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:43,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:43,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:00:43,713 INFO L87 Difference]: Start difference. First operand 631 states and 831 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:00:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:43,768 INFO L93 Difference]: Finished difference Result 1120 states and 1502 transitions. [2025-01-09 04:00:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 94 [2025-01-09 04:00:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:43,771 INFO L225 Difference]: With dead ends: 1120 [2025-01-09 04:00:43,772 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 04:00:43,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:00:43,774 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 51 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:43,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 04:00:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 519. [2025-01-09 04:00:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 379 states have (on average 1.20844327176781) internal successors, (458), 404 states have internal predecessors, (458), 70 states have call successors, (70), 60 states have call predecessors, (70), 69 states have return successors, (102), 67 states have call predecessors, (102), 70 states have call successors, (102) [2025-01-09 04:00:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 630 transitions. [2025-01-09 04:00:43,814 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 630 transitions. Word has length 94 [2025-01-09 04:00:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:43,814 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 630 transitions. [2025-01-09 04:00:43,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:00:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 630 transitions. [2025-01-09 04:00:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:00:43,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:43,819 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, 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, 1, 1, 1, 1, 1] [2025-01-09 04:00:43,824 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:44,019 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:44,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1009900518, now seen corresponding path program 1 times [2025-01-09 04:00:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:44,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914807905] [2025-01-09 04:00:44,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:44,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:00:44,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:00:44,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:44,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:00:44,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:44,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914807905] [2025-01-09 04:00:44,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914807905] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:44,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831393183] [2025-01-09 04:00:44,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:44,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:44,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:44,182 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:44,183 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:44,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:00:44,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:00:44,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:44,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:44,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:00:44,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:00:44,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:00:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831393183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:44,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:00:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-01-09 04:00:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537367111] [2025-01-09 04:00:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:44,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:44,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:44,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:00:44,315 INFO L87 Difference]: Start difference. First operand 519 states and 630 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 04:00:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:44,378 INFO L93 Difference]: Finished difference Result 992 states and 1227 transitions. [2025-01-09 04:00:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:00:44,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2025-01-09 04:00:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:44,383 INFO L225 Difference]: With dead ends: 992 [2025-01-09 04:00:44,383 INFO L226 Difference]: Without dead ends: 531 [2025-01-09 04:00:44,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:00:44,386 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 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:44,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 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:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-01-09 04:00:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-01-09 04:00:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 391 states have (on average 1.2020460358056266) internal successors, (470), 416 states have internal predecessors, (470), 70 states have call successors, (70), 60 states have call predecessors, (70), 69 states have return successors, (102), 67 states have call predecessors, (102), 70 states have call successors, (102) [2025-01-09 04:00:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 642 transitions. [2025-01-09 04:00:44,416 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 642 transitions. Word has length 104 [2025-01-09 04:00:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:44,416 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 642 transitions. [2025-01-09 04:00:44,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 04:00:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 642 transitions. [2025-01-09 04:00:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:00:44,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:44,418 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, 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, 1, 1, 1, 1, 1] [2025-01-09 04:00:44,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:00:44,619 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:44,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:44,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1071940132, now seen corresponding path program 1 times [2025-01-09 04:00:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:44,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765603047] [2025-01-09 04:00:44,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:44,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:00:44,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:00:44,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:44,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:00:44,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:44,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765603047] [2025-01-09 04:00:44,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765603047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:44,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463935398] [2025-01-09 04:00:44,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:44,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:44,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:44,848 INFO L229 MonitoredProcess]: Starting monitored process 5 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:44,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:00:44,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:00:44,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:00:44,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:44,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:44,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 04:00:44,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 04:00:45,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:00:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 04:00:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463935398] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:00:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 5] total 14 [2025-01-09 04:00:45,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203730160] [2025-01-09 04:00:45,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:45,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:45,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:45,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:00:45,234 INFO L87 Difference]: Start difference. First operand 531 states and 642 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 04:00:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:45,360 INFO L93 Difference]: Finished difference Result 1517 states and 1870 transitions. [2025-01-09 04:00:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:45,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2025-01-09 04:00:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:45,369 INFO L225 Difference]: With dead ends: 1517 [2025-01-09 04:00:45,369 INFO L226 Difference]: Without dead ends: 994 [2025-01-09 04:00:45,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:00:45,372 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 67 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:45,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 476 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-01-09 04:00:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 896. [2025-01-09 04:00:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 654 states have (on average 1.1773700305810397) internal successors, (770), 696 states have internal predecessors, (770), 120 states have call successors, (120), 104 states have call predecessors, (120), 121 states have return successors, (177), 117 states have call predecessors, (177), 120 states have call successors, (177) [2025-01-09 04:00:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1067 transitions. [2025-01-09 04:00:45,456 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1067 transitions. Word has length 104 [2025-01-09 04:00:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:45,456 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1067 transitions. [2025-01-09 04:00:45,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 04:00:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1067 transitions. [2025-01-09 04:00:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 04:00:45,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:45,459 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:45,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:00:45,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 04:00:45,665 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:45,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:45,665 INFO L85 PathProgramCache]: Analyzing trace with hash -875479712, now seen corresponding path program 1 times [2025-01-09 04:00:45,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:45,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552125836] [2025-01-09 04:00:45,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:45,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:00:45,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:00:45,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:45,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:00:45,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:45,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552125836] [2025-01-09 04:00:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552125836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:45,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963330555] [2025-01-09 04:00:45,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:45,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:45,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:45,779 INFO L229 MonitoredProcess]: Starting monitored process 6 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:45,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:00:45,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:00:45,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:00:45,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:45,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:45,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:00:45,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:00:45,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:00:45,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963330555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:45,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:00:45,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2025-01-09 04:00:45,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767409805] [2025-01-09 04:00:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:45,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:00:45,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:45,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:00:45,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:00:45,962 INFO L87 Difference]: Start difference. First operand 896 states and 1067 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 04:00:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:46,073 INFO L93 Difference]: Finished difference Result 1610 states and 1923 transitions. [2025-01-09 04:00:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:46,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2025-01-09 04:00:46,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:46,075 INFO L225 Difference]: With dead ends: 1610 [2025-01-09 04:00:46,075 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:00:46,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:00:46,078 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 27 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:46,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 913 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:00:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:00:46,079 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:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:00:46,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2025-01-09 04:00:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:46,080 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:00:46,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 04:00:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:00:46,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:00:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:00:46,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:00:46,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 04:00:46,286 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:46,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:00:50,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:00:50,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:00:50 BoogieIcfgContainer [2025-01-09 04:00:50,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:00:50,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:00:50,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:00:50,914 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:00:50,916 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:40" (3/4) ... [2025-01-09 04:00:50,917 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:00:50,922 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-01-09 04:00:50,922 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:00:50,922 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:00:50,922 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-01-09 04:00:50,922 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:00:50,922 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:00:50,922 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:00:50,922 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:00:50,922 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2025-01-09 04:00:50,926 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-01-09 04:00:50,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:00:50,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:00:50,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:00:50,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:00:50,999 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:00:50,999 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:00:50,999 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:00:51,001 INFO L158 Benchmark]: Toolchain (without parser) took 10796.75ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 105.1MB in the beginning and 208.0MB in the end (delta: -102.9MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2025-01-09 04:00:51,001 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:00:51,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.59ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 86.1MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:00:51,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.13ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:00:51,003 INFO L158 Benchmark]: Boogie Preprocessor took 39.03ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:00:51,003 INFO L158 Benchmark]: RCFGBuilder took 370.31ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 64.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:00:51,003 INFO L158 Benchmark]: TraceAbstraction took 9933.05ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 63.5MB in the beginning and 216.2MB in the end (delta: -152.6MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. [2025-01-09 04:00:51,003 INFO L158 Benchmark]: Witness Printer took 85.38ms. Allocated memory is still 369.1MB. Free memory was 216.2MB in the beginning and 208.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:00:51,004 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.14ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.59ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 86.1MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.13ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.8MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.03ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 370.31ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 64.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9933.05ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 63.5MB in the beginning and 216.2MB in the end (delta: -152.6MB). Peak memory consumption was 173.3MB. Max. memory is 16.1GB. * Witness Printer took 85.38ms. Allocated memory is still 369.1MB. Free memory was 216.2MB in the beginning and 208.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. 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,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [58] - GenericResultAtLocation [Line: 127]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [127] - GenericResultAtLocation [Line: 493]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [493] - GenericResultAtLocation [Line: 726]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [726] - GenericResultAtLocation [Line: 765]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [765] - GenericResultAtLocation [Line: 865]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [865] - GenericResultAtLocation [Line: 969]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [969] * 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: 54]: 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 10 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 716 mSDsluCounter, 4455 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2803 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 1652 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 634 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=12, 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.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 175 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1368 NumberOfCodeBlocks, 1368 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1453 ConstructedInterpolants, 0 QuantifiedInterpolants, 2759 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1702 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 377/421 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: 119]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 777]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 73]: 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))) RESULT: Ultimate proved your program to be correct! [2025-01-09 04:00:51,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE