./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product60.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_product60.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 a218bb67596641a4ce71d6987e627686ed630ab4299f0e9b54dfa98d78549c82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:00:48,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:00:48,394 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:48,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:00:48,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:00:48,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:00:48,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:00:48,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:00:48,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:00:48,430 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:00:48,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:00:48,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:00:48,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:00:48,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:00:48,431 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:00:48,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:00:48,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:00:48,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:00:48,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:00:48,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:00:48,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:00:48,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:00:48,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:48,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:00:48,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:00:48,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:00:48,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:00:48,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:48,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:00:48,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:00:48,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:00:48,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:00:48,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:00:48,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:00:48,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:00:48,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:00:48,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:00:48,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:00:48,434 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 -> a218bb67596641a4ce71d6987e627686ed630ab4299f0e9b54dfa98d78549c82 [2025-01-09 04:00:48,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:00:48,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:00:48,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:00:48,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:00:48,685 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:00:48,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c [2025-01-09 04:00:49,942 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da93bc233/ab6a562b8e124870a643ff24701ffc53/FLAG679fa4ba7 [2025-01-09 04:00:50,324 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:00:50,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c [2025-01-09 04:00:50,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da93bc233/ab6a562b8e124870a643ff24701ffc53/FLAG679fa4ba7 [2025-01-09 04:00:50,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da93bc233/ab6a562b8e124870a643ff24701ffc53 [2025-01-09 04:00:50,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:00:50,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:00:50,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:00:50,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:00:50,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:00:50,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:50" (1/1) ... [2025-01-09 04:00:50,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f04b204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:50, skipping insertion in model container [2025-01-09 04:00:50,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:50" (1/1) ... [2025-01-09 04:00:50,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:00:50,730 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_product60.cil.c[3241,3254] [2025-01-09 04:00:50,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:00:50,834 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:00:50,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2025-01-09 04:00:50,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [160] [2025-01-09 04:00:50,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] [2025-01-09 04:00:50,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [273] [2025-01-09 04:00:50,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [308] [2025-01-09 04:00:50,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [379] [2025-01-09 04:00:50,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [745] [2025-01-09 04:00:50,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [987] [2025-01-09 04:00:50,850 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_product60.cil.c[3241,3254] [2025-01-09 04:00:50,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:00:50,920 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:00:50,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:50 WrapperNode [2025-01-09 04:00:50,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:00:50,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:00:50,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:00:50,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:00:50,927 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:50" (1/1) ... [2025-01-09 04:00:50,938 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:50" (1/1) ... [2025-01-09 04:00:50,962 INFO L138 Inliner]: procedures = 59, calls = 104, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 226 [2025-01-09 04:00:50,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:00:50,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:00:50,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:00:50,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:00:50,970 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:50" (1/1) ... [2025-01-09 04:00:50,970 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:50" (1/1) ... [2025-01-09 04:00:50,975 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:50" (1/1) ... [2025-01-09 04:00:50,982 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:50,982 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:50" (1/1) ... [2025-01-09 04:00:50,982 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:50" (1/1) ... [2025-01-09 04:00:50,985 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:50" (1/1) ... [2025-01-09 04:00:50,987 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:50" (1/1) ... [2025-01-09 04:00:50,993 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:50" (1/1) ... [2025-01-09 04:00:50,994 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:50" (1/1) ... [2025-01-09 04:00:50,998 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:50" (1/1) ... [2025-01-09 04:00:51,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:00:51,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:00:51,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:00:51,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:00:51,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:50" (1/1) ... [2025-01-09 04:00:51,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:51,025 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:51,027 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:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:00:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:00:51,048 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:00:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:00:51,048 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:00:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:00:51,048 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:00:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-01-09 04:00:51,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-01-09 04:00:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:00:51,049 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:00:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:00:51,049 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:00:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-01-09 04:00:51,049 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-01-09 04:00:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:00:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:00:51,050 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:00:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:00:51,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:00:51,108 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:00:51,109 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:00:51,356 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-01-09 04:00:51,357 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:00:51,368 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:00:51,369 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:00:51,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:51 BoogieIcfgContainer [2025-01-09 04:00:51,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:00:51,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:00:51,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:00:51,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:00:51,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:00:50" (1/3) ... [2025-01-09 04:00:51,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c78e265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:51, skipping insertion in model container [2025-01-09 04:00:51,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:50" (2/3) ... [2025-01-09 04:00:51,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c78e265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:51, skipping insertion in model container [2025-01-09 04:00:51,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:51" (3/3) ... [2025-01-09 04:00:51,379 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product60.cil.c [2025-01-09 04:00:51,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:00:51,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product60.cil.c that has 9 procedures, 99 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:00:51,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:00:51,454 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;@27182d53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:00:51,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:00:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 75 states have (on average 1.36) internal successors, (102), 84 states have internal predecessors, (102), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 04:00:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:00:51,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:51,464 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:51,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:51,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:51,469 INFO L85 PathProgramCache]: Analyzing trace with hash -222467462, now seen corresponding path program 1 times [2025-01-09 04:00:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:51,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817108544] [2025-01-09 04:00:51,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:51,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:00:51,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:00:51,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:51,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:51,601 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:51,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:51,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817108544] [2025-01-09 04:00:51,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817108544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:51,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:51,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:00:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293901776] [2025-01-09 04:00:51,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:51,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:00:51,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:51,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:00:51,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:00:51,621 INFO L87 Difference]: Start difference. First operand has 99 states, 75 states have (on average 1.36) internal successors, (102), 84 states have internal predecessors, (102), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 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:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:51,650 INFO L93 Difference]: Finished difference Result 189 states and 254 transitions. [2025-01-09 04:00:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:00:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 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:51,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:51,659 INFO L225 Difference]: With dead ends: 189 [2025-01-09 04:00:51,659 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 04:00:51,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:00:51,665 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:51,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 04:00:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 04:00:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 76 states have internal predecessors, (90), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 04:00:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2025-01-09 04:00:51,718 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 25 [2025-01-09 04:00:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:51,720 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2025-01-09 04:00:51,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 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:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2025-01-09 04:00:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:00:51,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:51,723 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:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:00:51,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:51,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash 361448014, now seen corresponding path program 1 times [2025-01-09 04:00:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558766898] [2025-01-09 04:00:51,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:00:51,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:00:51,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:51,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:51,834 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:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558766898] [2025-01-09 04:00:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558766898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495208533] [2025-01-09 04:00:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:51,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:51,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:51,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:51,836 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. 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:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:51,848 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2025-01-09 04:00:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:51,849 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:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:51,849 INFO L225 Difference]: With dead ends: 142 [2025-01-09 04:00:51,849 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 04:00:51,850 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:51,851 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 17 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 189 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:51,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 189 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:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 04:00:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 04:00:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 04:00:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2025-01-09 04:00:51,869 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 25 [2025-01-09 04:00:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:51,869 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2025-01-09 04:00:51,869 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:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2025-01-09 04:00:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 04:00:51,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:51,870 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] [2025-01-09 04:00:51,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:00:51,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:51,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1115917945, now seen corresponding path program 1 times [2025-01-09 04:00:51,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:51,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250403005] [2025-01-09 04:00:51,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:51,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:51,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 04:00:51,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 04:00:51,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:51,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:51,931 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:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:51,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250403005] [2025-01-09 04:00:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250403005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727523544] [2025-01-09 04:00:51,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:51,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:51,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:51,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:51,933 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:51,959 INFO L93 Difference]: Finished difference Result 228 states and 301 transitions. [2025-01-09 04:00:51,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:51,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2025-01-09 04:00:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:51,961 INFO L225 Difference]: With dead ends: 228 [2025-01-09 04:00:51,961 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 04:00:51,962 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:51,962 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 84 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:51,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 216 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 04:00:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-01-09 04:00:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 114 states have (on average 1.3596491228070176) internal successors, (155), 129 states have internal predecessors, (155), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 04:00:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2025-01-09 04:00:51,975 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 30 [2025-01-09 04:00:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:51,975 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2025-01-09 04:00:51,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2025-01-09 04:00:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 04:00:51,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:51,976 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] [2025-01-09 04:00:51,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:00:51,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:51,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1800648366, now seen corresponding path program 1 times [2025-01-09 04:00:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:51,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295954497] [2025-01-09 04:00:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:51,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 04:00:51,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 04:00:51,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:51,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:52,061 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:52,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:52,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295954497] [2025-01-09 04:00:52,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295954497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:52,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:52,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:00:52,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672943739] [2025-01-09 04:00:52,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:52,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:52,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:52,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:52,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:52,063 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 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:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:52,128 INFO L93 Difference]: Finished difference Result 377 states and 508 transitions. [2025-01-09 04:00:52,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:00:52,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 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 33 [2025-01-09 04:00:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:52,130 INFO L225 Difference]: With dead ends: 377 [2025-01-09 04:00:52,130 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 04:00:52,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:00:52,131 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 56 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:52,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 362 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 04:00:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2025-01-09 04:00:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 176 states have (on average 1.3181818181818181) internal successors, (232), 193 states have internal predecessors, (232), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-01-09 04:00:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 300 transitions. [2025-01-09 04:00:52,155 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 300 transitions. Word has length 33 [2025-01-09 04:00:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:52,155 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 300 transitions. [2025-01-09 04:00:52,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 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:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 300 transitions. [2025-01-09 04:00:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:00:52,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:52,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:52,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:00:52,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:52,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:52,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1833230235, now seen corresponding path program 1 times [2025-01-09 04:00:52,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:52,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497701361] [2025-01-09 04:00:52,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:52,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:00:52,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:00:52,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:52,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:52,266 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:52,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:52,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497701361] [2025-01-09 04:00:52,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497701361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:52,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:52,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:00:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213798278] [2025-01-09 04:00:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:52,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:52,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:52,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:52,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:52,268 INFO L87 Difference]: Start difference. First operand 233 states and 300 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 2 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:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:52,320 INFO L93 Difference]: Finished difference Result 466 states and 617 transitions. [2025-01-09 04:00:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:52,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 2 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 52 [2025-01-09 04:00:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:52,325 INFO L225 Difference]: With dead ends: 466 [2025-01-09 04:00:52,325 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 04:00:52,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:00:52,329 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 86 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:52,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 433 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 04:00:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2025-01-09 04:00:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 180 states have (on average 1.3111111111111111) internal successors, (236), 197 states have internal predecessors, (236), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-01-09 04:00:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 304 transitions. [2025-01-09 04:00:52,385 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 304 transitions. Word has length 52 [2025-01-09 04:00:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:52,385 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 304 transitions. [2025-01-09 04:00:52,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 2 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:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 304 transitions. [2025-01-09 04:00:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:00:52,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:52,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:52,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:00:52,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:52,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash -89997799, now seen corresponding path program 1 times [2025-01-09 04:00:52,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:52,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814410329] [2025-01-09 04:00:52,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:52,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:00:52,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:00:52,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:52,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:52,484 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:52,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:52,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814410329] [2025-01-09 04:00:52,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814410329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:52,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:52,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:00:52,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635000858] [2025-01-09 04:00:52,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:52,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:52,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:52,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:52,487 INFO L87 Difference]: Start difference. First operand 237 states and 304 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:52,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:52,514 INFO L93 Difference]: Finished difference Result 472 states and 624 transitions. [2025-01-09 04:00:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:00:52,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 52 [2025-01-09 04:00:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:52,516 INFO L225 Difference]: With dead ends: 472 [2025-01-09 04:00:52,516 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 04:00:52,516 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:52,517 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 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:52,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 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:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 04:00:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-01-09 04:00:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 203 states have internal predecessors, (242), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-01-09 04:00:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 310 transitions. [2025-01-09 04:00:52,529 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 310 transitions. Word has length 52 [2025-01-09 04:00:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:52,530 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 310 transitions. [2025-01-09 04:00:52,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 310 transitions. [2025-01-09 04:00:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:00:52,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:52,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:52,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:00:52,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:52,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1075533667, now seen corresponding path program 1 times [2025-01-09 04:00:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:52,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399087912] [2025-01-09 04:00:52,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:52,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:00:52,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:00:52,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:52,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:52,617 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:52,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:52,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399087912] [2025-01-09 04:00:52,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399087912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:52,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:52,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:00:52,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008117972] [2025-01-09 04:00:52,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:52,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:00:52,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:52,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:00:52,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:00:52,619 INFO L87 Difference]: Start difference. First operand 243 states and 310 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:52,765 INFO L93 Difference]: Finished difference Result 783 states and 1029 transitions. [2025-01-09 04:00:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:00:52,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 52 [2025-01-09 04:00:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:52,768 INFO L225 Difference]: With dead ends: 783 [2025-01-09 04:00:52,768 INFO L226 Difference]: Without dead ends: 548 [2025-01-09 04:00:52,770 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:52,770 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 131 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:52,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 305 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-01-09 04:00:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 536. [2025-01-09 04:00:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 407 states have (on average 1.2776412776412776) internal successors, (520), 438 states have internal predecessors, (520), 66 states have call successors, (66), 60 states have call predecessors, (66), 62 states have return successors, (102), 62 states have call predecessors, (102), 66 states have call successors, (102) [2025-01-09 04:00:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 688 transitions. [2025-01-09 04:00:52,830 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 688 transitions. Word has length 52 [2025-01-09 04:00:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:52,832 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 688 transitions. [2025-01-09 04:00:52,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 688 transitions. [2025-01-09 04:00:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:00:52,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:52,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:52,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:00:52,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:52,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:52,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1467362755, now seen corresponding path program 1 times [2025-01-09 04:00:52,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:52,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842162293] [2025-01-09 04:00:52,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:52,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:52,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:00:52,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:00:52,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:52,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:52,897 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:52,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:52,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842162293] [2025-01-09 04:00:52,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842162293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:52,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:52,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252807947] [2025-01-09 04:00:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:52,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:52,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:52,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:52,898 INFO L87 Difference]: Start difference. First operand 536 states and 688 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:52,945 INFO L93 Difference]: Finished difference Result 890 states and 1178 transitions. [2025-01-09 04:00:52,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:52,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 56 [2025-01-09 04:00:52,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:52,952 INFO L225 Difference]: With dead ends: 890 [2025-01-09 04:00:52,952 INFO L226 Difference]: Without dead ends: 888 [2025-01-09 04:00:52,952 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:52,953 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 78 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 199 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:52,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 199 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:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-01-09 04:00:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 860. [2025-01-09 04:00:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 649 states have (on average 1.2819722650231125) internal successors, (832), 704 states have internal predecessors, (832), 110 states have call successors, (110), 98 states have call predecessors, (110), 100 states have return successors, (199), 96 states have call predecessors, (199), 110 states have call successors, (199) [2025-01-09 04:00:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1141 transitions. [2025-01-09 04:00:53,022 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1141 transitions. Word has length 56 [2025-01-09 04:00:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:53,022 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1141 transitions. [2025-01-09 04:00:53,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1141 transitions. [2025-01-09 04:00:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:00:53,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:53,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 04:00:53,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:00:53,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:53,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash 888989036, now seen corresponding path program 1 times [2025-01-09 04:00:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:53,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911997072] [2025-01-09 04:00:53,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:53,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:00:53,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:00:53,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:53,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:00:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911997072] [2025-01-09 04:00:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911997072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:53,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:00:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665051771] [2025-01-09 04:00:53,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:53,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:00:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:53,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:00:53,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:00:53,078 INFO L87 Difference]: Start difference. First operand 860 states and 1141 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 04:00:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:53,173 INFO L93 Difference]: Finished difference Result 1401 states and 1856 transitions. [2025-01-09 04:00:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:00:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 85 [2025-01-09 04:00:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:53,177 INFO L225 Difference]: With dead ends: 1401 [2025-01-09 04:00:53,178 INFO L226 Difference]: Without dead ends: 549 [2025-01-09 04:00:53,179 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:53,181 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 126 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:53,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 251 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-01-09 04:00:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 522. [2025-01-09 04:00:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 398 states have (on average 1.263819095477387) internal successors, (503), 429 states have internal predecessors, (503), 63 states have call successors, (63), 58 states have call predecessors, (63), 60 states have return successors, (106), 59 states have call predecessors, (106), 63 states have call successors, (106) [2025-01-09 04:00:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 672 transitions. [2025-01-09 04:00:53,216 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 672 transitions. Word has length 85 [2025-01-09 04:00:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:53,216 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 672 transitions. [2025-01-09 04:00:53,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 04:00:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 672 transitions. [2025-01-09 04:00:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:00:53,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:53,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:00:53,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:53,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash 387002875, now seen corresponding path program 1 times [2025-01-09 04:00:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:53,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909236655] [2025-01-09 04:00:53,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:53,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:00:53,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:00:53,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:53,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 04:00:53,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:53,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909236655] [2025-01-09 04:00:53,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909236655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:53,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362312521] [2025-01-09 04:00:53,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:53,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:53,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:53,343 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:53,346 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:53,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:00:53,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:00:53,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:53,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:53,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 04:00:53,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:00:53,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:00:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362312521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:53,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:00:53,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-01-09 04:00:53,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285353701] [2025-01-09 04:00:53,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:53,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:53,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:53,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:53,540 INFO L87 Difference]: Start difference. First operand 522 states and 672 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:00:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:53,809 INFO L93 Difference]: Finished difference Result 1228 states and 1654 transitions. [2025-01-09 04:00:53,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:53,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 101 [2025-01-09 04:00:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:53,814 INFO L225 Difference]: With dead ends: 1228 [2025-01-09 04:00:53,814 INFO L226 Difference]: Without dead ends: 792 [2025-01-09 04:00:53,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:00:53,816 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 150 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:53,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 393 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:00:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-01-09 04:00:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 767. [2025-01-09 04:00:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 584 states have (on average 1.2517123287671232) internal successors, (731), 623 states have internal predecessors, (731), 95 states have call successors, (95), 78 states have call predecessors, (95), 87 states have return successors, (211), 95 states have call predecessors, (211), 95 states have call successors, (211) [2025-01-09 04:00:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1037 transitions. [2025-01-09 04:00:53,954 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1037 transitions. Word has length 101 [2025-01-09 04:00:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:53,958 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1037 transitions. [2025-01-09 04:00:53,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:00:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1037 transitions. [2025-01-09 04:00:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:00:53,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:53,961 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] [2025-01-09 04:00:53,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:00:54,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 04:00:54,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:54,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash -47030945, now seen corresponding path program 1 times [2025-01-09 04:00:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:54,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995367826] [2025-01-09 04:00:54,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:54,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:00:54,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:00:54,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:54,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:00:54,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:54,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995367826] [2025-01-09 04:00:54,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995367826] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:54,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116253223] [2025-01-09 04:00:54,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:54,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:54,378 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:54,381 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:54,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:00:54,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:00:54,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:54,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:54,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 04:00:54,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 04:00:54,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:00:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 04:00:54,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116253223] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:54,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:00:54,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 10 [2025-01-09 04:00:54,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056365793] [2025-01-09 04:00:54,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:54,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:54,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:54,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:00:54,793 INFO L87 Difference]: Start difference. First operand 767 states and 1037 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:00:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:55,015 INFO L93 Difference]: Finished difference Result 2187 states and 3066 transitions. [2025-01-09 04:00:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:55,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2025-01-09 04:00:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:55,033 INFO L225 Difference]: With dead ends: 2187 [2025-01-09 04:00:55,034 INFO L226 Difference]: Without dead ends: 1428 [2025-01-09 04:00:55,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:00:55,039 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 63 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:55,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 475 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-01-09 04:00:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1268. [2025-01-09 04:00:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 954 states have (on average 1.2243186582809225) internal successors, (1168), 1023 states have internal predecessors, (1168), 161 states have call successors, (161), 134 states have call predecessors, (161), 152 states have return successors, (338), 163 states have call predecessors, (338), 161 states have call successors, (338) [2025-01-09 04:00:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1667 transitions. [2025-01-09 04:00:55,200 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1667 transitions. Word has length 97 [2025-01-09 04:00:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:55,200 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1667 transitions. [2025-01-09 04:00:55,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:00:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1667 transitions. [2025-01-09 04:00:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:00:55,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:55,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:55,216 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:55,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:55,408 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:55,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1610990395, now seen corresponding path program 1 times [2025-01-09 04:00:55,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:55,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176033582] [2025-01-09 04:00:55,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:55,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:55,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:00:55,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:00:55,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:55,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:00:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176033582] [2025-01-09 04:00:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176033582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:55,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70092765] [2025-01-09 04:00:55,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:55,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:55,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:55,524 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:55,526 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:55,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:00:55,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:00:55,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:55,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:55,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:00:55,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:00:55,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:00:55,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70092765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:55,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:00:55,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-01-09 04:00:55,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756322548] [2025-01-09 04:00:55,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:55,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:00:55,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:55,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:00:55,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:00:55,705 INFO L87 Difference]: Start difference. First operand 1268 states and 1667 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:00:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:56,007 INFO L93 Difference]: Finished difference Result 2432 states and 3218 transitions. [2025-01-09 04:00:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:56,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 101 [2025-01-09 04:00:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:56,016 INFO L225 Difference]: With dead ends: 2432 [2025-01-09 04:00:56,016 INFO L226 Difference]: Without dead ends: 1172 [2025-01-09 04:00:56,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:00:56,020 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 69 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:56,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 914 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:00:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-01-09 04:00:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1160. [2025-01-09 04:00:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 873 states have (on average 1.2073310423825887) internal successors, (1054), 934 states have internal predecessors, (1054), 150 states have call successors, (150), 127 states have call predecessors, (150), 136 states have return successors, (261), 146 states have call predecessors, (261), 150 states have call successors, (261) [2025-01-09 04:00:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1465 transitions. [2025-01-09 04:00:56,076 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1465 transitions. Word has length 101 [2025-01-09 04:00:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:56,076 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1465 transitions. [2025-01-09 04:00:56,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:00:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1465 transitions. [2025-01-09 04:00:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 04:00:56,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:56,080 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:56,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:00:56,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:56,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:56,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:56,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1296158051, now seen corresponding path program 1 times [2025-01-09 04:00:56,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:56,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342846550] [2025-01-09 04:00:56,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:56,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:56,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:00:56,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:00:56,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:56,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 46 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 04:00:56,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:56,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342846550] [2025-01-09 04:00:56,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342846550] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884226800] [2025-01-09 04:00:56,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:56,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:56,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:56,529 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:56,535 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:56,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:00:56,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:00:56,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:56,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:56,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 04:00:56,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:00:56,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:00:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 46 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 04:00:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884226800] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:00:57,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:00:57,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 04:00:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996082618] [2025-01-09 04:00:57,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:00:57,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:00:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:57,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:00:57,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:00:57,010 INFO L87 Difference]: Start difference. First operand 1160 states and 1465 transitions. Second operand has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 7 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 04:00:57,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:57,549 INFO L93 Difference]: Finished difference Result 2751 states and 3576 transitions. [2025-01-09 04:00:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:00:57,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 7 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) Word has length 139 [2025-01-09 04:00:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:57,559 INFO L225 Difference]: With dead ends: 2751 [2025-01-09 04:00:57,559 INFO L226 Difference]: Without dead ends: 1759 [2025-01-09 04:00:57,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:00:57,563 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 352 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:57,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 528 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:00:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2025-01-09 04:00:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1512. [2025-01-09 04:00:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1134 states have (on average 1.215167548500882) internal successors, (1378), 1216 states have internal predecessors, (1378), 198 states have call successors, (198), 168 states have call predecessors, (198), 179 states have return successors, (350), 179 states have call predecessors, (350), 198 states have call successors, (350) [2025-01-09 04:00:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1926 transitions. [2025-01-09 04:00:57,685 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1926 transitions. Word has length 139 [2025-01-09 04:00:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:57,685 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1926 transitions. [2025-01-09 04:00:57,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 7 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (24), 7 states have call predecessors, (24), 6 states have call successors, (24) [2025-01-09 04:00:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1926 transitions. [2025-01-09 04:00:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 04:00:57,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:57,689 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,696 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:57,894 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,SelfDestructingSolverStorable12 [2025-01-09 04:00:57,894 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:57,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash -90045343, now seen corresponding path program 1 times [2025-01-09 04:00:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:57,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567286285] [2025-01-09 04:00:57,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:57,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:57,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:00:57,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:00:57,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:57,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 04:00:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567286285] [2025-01-09 04:00:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567286285] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143571106] [2025-01-09 04:00:58,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:58,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:58,095 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:58,097 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:58,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:00:58,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:00:58,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:58,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:58,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 04:00:58,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 79 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:00:58,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:00:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 04:00:58,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143571106] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:00:58,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:00:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2025-01-09 04:00:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255043135] [2025-01-09 04:00:58,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:00:58,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:00:58,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:58,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:00:58,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:00:58,528 INFO L87 Difference]: Start difference. First operand 1512 states and 1926 transitions. Second operand has 19 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 7 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2025-01-09 04:00:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:59,389 INFO L93 Difference]: Finished difference Result 4043 states and 5405 transitions. [2025-01-09 04:00:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:00:59,389 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 7 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 139 [2025-01-09 04:00:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:59,400 INFO L225 Difference]: With dead ends: 4043 [2025-01-09 04:00:59,401 INFO L226 Difference]: Without dead ends: 2696 [2025-01-09 04:00:59,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:00:59,406 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 362 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:59,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1445 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:00:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2025-01-09 04:00:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2470. [2025-01-09 04:00:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 1856 states have (on average 1.2112068965517242) internal successors, (2248), 1970 states have internal predecessors, (2248), 323 states have call successors, (323), 293 states have call predecessors, (323), 290 states have return successors, (542), 284 states have call predecessors, (542), 323 states have call successors, (542) [2025-01-09 04:00:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3113 transitions. [2025-01-09 04:00:59,557 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3113 transitions. Word has length 139 [2025-01-09 04:00:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:59,558 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 3113 transitions. [2025-01-09 04:00:59,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.157894736842104) internal successors, (155), 19 states have internal predecessors, (155), 7 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2025-01-09 04:00:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3113 transitions. [2025-01-09 04:00:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 04:00:59,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:59,562 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:59,569 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:59,767 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,SelfDestructingSolverStorable13 [2025-01-09 04:00:59,767 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:59,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1776225181, now seen corresponding path program 1 times [2025-01-09 04:00:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143513934] [2025-01-09 04:00:59,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:59,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:00:59,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:00:59,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:59,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 44 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 04:00:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:59,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143513934] [2025-01-09 04:00:59,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143513934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:59,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782236009] [2025-01-09 04:00:59,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:59,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:59,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:59,867 INFO L229 MonitoredProcess]: Starting monitored process 7 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:59,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:00:59,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:00:59,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:00:59,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:59,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:59,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:00:59,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 04:00:59,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:00:59,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782236009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:59,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:00:59,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-01-09 04:00:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548146028] [2025-01-09 04:00:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:59,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:59,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:59,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:00:59,979 INFO L87 Difference]: Start difference. First operand 2470 states and 3113 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:01:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:00,060 INFO L93 Difference]: Finished difference Result 3038 states and 3779 transitions. [2025-01-09 04:01:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:00,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 139 [2025-01-09 04:01:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:00,063 INFO L225 Difference]: With dead ends: 3038 [2025-01-09 04:01:00,063 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:01:00,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:01:00,068 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:00,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:01:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:01:00,069 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:01:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:01:00,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2025-01-09 04:01:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:00,070 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:01:00,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:01:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:01:00,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:01:00,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:01:00,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 04:01:00,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 04:01:00,276 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:00,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:01:05,946 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:01:05,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:01:05 BoogieIcfgContainer [2025-01-09 04:01:05,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:01:05,955 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:01:05,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:01:05,956 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:01:05,956 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:51" (3/4) ... [2025-01-09 04:01:05,957 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:01:05,961 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-01-09 04:01:05,961 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:01:05,961 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:01:05,961 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:01:05,961 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:01:05,961 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-01-09 04:01:05,962 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:01:05,962 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:01:05,965 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-01-09 04:01:05,966 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:01:05,966 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:01:05,966 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:01:05,967 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:01:06,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:01:06,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:01:06,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:01:06,042 INFO L158 Benchmark]: Toolchain (without parser) took 15480.44ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 104.2MB in the beginning and 200.6MB in the end (delta: -96.3MB). Peak memory consumption was 215.0MB. Max. memory is 16.1GB. [2025-01-09 04:01:06,042 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:01:06,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.99ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 85.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:01:06,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.48ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:06,042 INFO L158 Benchmark]: Boogie Preprocessor took 36.73ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 82.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:01:06,043 INFO L158 Benchmark]: RCFGBuilder took 368.23ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 63.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:01:06,043 INFO L158 Benchmark]: TraceAbstraction took 14582.27ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 63.2MB in the beginning and 208.8MB in the end (delta: -145.5MB). Peak memory consumption was 220.8MB. Max. memory is 16.1GB. [2025-01-09 04:01:06,043 INFO L158 Benchmark]: Witness Printer took 85.72ms. Allocated memory is still 453.0MB. Free memory was 208.8MB in the beginning and 200.6MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:06,045 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.99ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 85.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.48ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.73ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 82.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 368.23ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 63.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14582.27ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 63.2MB in the beginning and 208.8MB in the end (delta: -145.5MB). Peak memory consumption was 220.8MB. Max. memory is 16.1GB. * Witness Printer took 85.72ms. Allocated memory is still 453.0MB. Free memory was 208.8MB in the beginning and 200.6MB 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,"Environment.i","") [49] - GenericResultAtLocation [Line: 160]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [160] - GenericResultAtLocation [Line: 169]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] - GenericResultAtLocation [Line: 273]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [273] - GenericResultAtLocation [Line: 308]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [308] - GenericResultAtLocation [Line: 379]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [379] - GenericResultAtLocation [Line: 745]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [745] - GenericResultAtLocation [Line: 987]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [987] * 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: 165]: 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 9 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1612 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1574 mSDsluCounter, 6641 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4713 mSDsCounter, 341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2089 IncrementalHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 341 mSolverCounterUnsat, 1928 mSDtfsCounter, 2089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1200 GetRequests, 1097 SyntacticMatches, 5 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2470occurred in iteration=14, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 745 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1842 NumberOfCodeBlocks, 1842 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2193 ConstructedInterpolants, 0 QuantifiedInterpolants, 4409 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2341 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 24 InterpolantComputations, 13 PerfectInterpolantSequences, 927/1062 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: 321]: Loop Invariant Derived loop invariant: ((((((((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1))) || ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (0 == systemActive)) && (waterLevel == 1))) || ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (splverifierCounter == 0)) && (0 == systemActive))) || ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (1 <= waterLevel)) && (0 == systemActive))) - InvariantResult [Line: 371]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-01-09 04:01:06,074 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