./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product45.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product45.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8ef44eebf77bb9089ba7256f54c924b643d97224560b14ff4a2b7df3dcc9e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:28:50,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:28:50,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:28:50,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:28:50,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:28:50,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:28:50,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:28:50,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:28:50,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:28:50,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:28:50,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:28:50,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:28:50,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:28:50,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:28:50,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:28:50,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:28:50,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:28:50,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:28:50,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:28:50,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:28:50,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:28:50,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:28:50,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:28:50,782 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/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 -> 9a8ef44eebf77bb9089ba7256f54c924b643d97224560b14ff4a2b7df3dcc9e0 [2025-03-03 14:28:50,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:28:51,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:28:51,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:28:51,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:28:51,004 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:28:51,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product45.cil.c [2025-03-03 14:28:52,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9f0ceb6/81e94d2e00854824834d10de32a7f4ad/FLAGaed606b66 [2025-03-03 14:28:52,483 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:28:52,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product45.cil.c [2025-03-03 14:28:52,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9f0ceb6/81e94d2e00854824834d10de32a7f4ad/FLAGaed606b66 [2025-03-03 14:28:52,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9f0ceb6/81e94d2e00854824834d10de32a7f4ad [2025-03-03 14:28:52,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:28:52,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:28:52,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:28:52,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:28:52,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:28:52,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:28:52" (1/1) ... [2025-03-03 14:28:52,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5709abd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:52, skipping insertion in model container [2025-03-03 14:28:52,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:28:52" (1/1) ... [2025-03-03 14:28:52,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:28:52,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product45.cil.c[3064,3077] [2025-03-03 14:28:53,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:28:53,039 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:28:53,045 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2025-03-03 14:28:53,047 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] [2025-03-03 14:28:53,047 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [159] [2025-03-03 14:28:53,047 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [186] [2025-03-03 14:28:53,047 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [288] [2025-03-03 14:28:53,047 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [323] [2025-03-03 14:28:53,048 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [689] [2025-03-03 14:28:53,048 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [754] [2025-03-03 14:28:53,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product45.cil.c[3064,3077] [2025-03-03 14:28:53,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:28:53,132 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:28:53,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53 WrapperNode [2025-03-03 14:28:53,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:28:53,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:28:53,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:28:53,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:28:53,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,173 INFO L138 Inliner]: procedures = 54, calls = 99, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 182 [2025-03-03 14:28:53,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:28:53,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:28:53,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:28:53,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:28:53,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,197 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-03-03 14:28:53,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:28:53,205 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:28:53,205 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:28:53,205 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:28:53,206 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (1/1) ... [2025-03-03 14:28:53,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:28:53,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:28:53,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:28:53,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:28:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:28:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-03 14:28:53,245 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-03 14:28:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:28:53,245 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:28:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:28:53,245 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:28:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-03 14:28:53,245 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-03 14:28:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-03 14:28:53,246 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-03 14:28:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2025-03-03 14:28:53,246 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2025-03-03 14:28:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-03-03 14:28:53,246 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-03-03 14:28:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:28:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-03 14:28:53,246 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-03 14:28:53,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:28:53,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:28:53,289 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:28:53,291 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:28:53,374 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L893-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; [2025-03-03 14:28:53,402 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: #res := ~retValue_acc~0; [2025-03-03 14:28:53,476 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L320-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-03-03 14:28:53,477 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L285-1: main_#res#1 := main_~retValue_acc~3#1; [2025-03-03 14:28:53,512 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L948-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; [2025-03-03 14:28:53,512 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L147-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2025-03-03 14:28:53,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L884: #res := ~retValue_acc~9; [2025-03-03 14:28:53,527 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-03 14:28:53,528 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:28:53,534 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:28:53,536 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:28:53,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:28:53 BoogieIcfgContainer [2025-03-03 14:28:53,536 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:28:53,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:28:53,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:28:53,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:28:53,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:28:52" (1/3) ... [2025-03-03 14:28:53,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa4464c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:28:53, skipping insertion in model container [2025-03-03 14:28:53,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:28:53" (2/3) ... [2025-03-03 14:28:53,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa4464c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:28:53, skipping insertion in model container [2025-03-03 14:28:53,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:28:53" (3/3) ... [2025-03-03 14:28:53,542 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product45.cil.c [2025-03-03 14:28:53,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:28:53,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product45.cil.c that has 9 procedures, 92 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:28:53,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:28:53,598 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;@4627af47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:28:53,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:28:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 76 states have internal predecessors, (92), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 14:28:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:28:53,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:53,607 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] [2025-03-03 14:28:53,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:53,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:53,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1373798770, now seen corresponding path program 1 times [2025-03-03 14:28:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:53,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251304947] [2025-03-03 14:28:53,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:53,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:28:53,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:28:53,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:53,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:28:53,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:53,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251304947] [2025-03-03 14:28:53,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251304947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:53,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:53,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:28:53,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789199435] [2025-03-03 14:28:53,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:53,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:28:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:53,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:28:53,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:28:53,755 INFO L87 Difference]: Start difference. First operand has 92 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 76 states have internal predecessors, (92), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-03-03 14:28:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:53,774 INFO L93 Difference]: Finished difference Result 176 states and 235 transitions. [2025-03-03 14:28:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:28:53,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 23 [2025-03-03 14:28:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:53,781 INFO L225 Difference]: With dead ends: 176 [2025-03-03 14:28:53,781 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 14:28:53,783 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-03-03 14:28:53,785 INFO L435 NwaCegarLoop]: 116 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, 116 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-03-03 14:28:53,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 14:28:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 14:28:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 68 states have internal predecessors, (80), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 14:28:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2025-03-03 14:28:53,816 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 23 [2025-03-03 14:28:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:53,817 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2025-03-03 14:28:53,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-03-03 14:28:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2025-03-03 14:28:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 14:28:53,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:53,818 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] [2025-03-03 14:28:53,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:28:53,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:53,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:53,822 INFO L85 PathProgramCache]: Analyzing trace with hash -785064364, now seen corresponding path program 1 times [2025-03-03 14:28:53,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:53,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922592784] [2025-03-03 14:28:53,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:53,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:53,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:28:53,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:28:53,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:53,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:28:53,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:53,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922592784] [2025-03-03 14:28:53,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922592784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:53,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:53,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:53,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406691120] [2025-03-03 14:28:53,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:53,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:53,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:53,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:53,898 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-03-03 14:28:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:53,914 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2025-03-03 14:28:53,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:53,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2025-03-03 14:28:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:53,915 INFO L225 Difference]: With dead ends: 133 [2025-03-03 14:28:53,915 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 14:28:53,916 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-03-03 14:28:53,917 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 173 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-03-03 14:28:53,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 173 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 14:28:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-03 14:28:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 14:28:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2025-03-03 14:28:53,924 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 24 [2025-03-03 14:28:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:53,924 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2025-03-03 14:28:53,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-03-03 14:28:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2025-03-03 14:28:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 14:28:53,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:53,925 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] [2025-03-03 14:28:53,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:28:53,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:53,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2012643174, now seen corresponding path program 1 times [2025-03-03 14:28:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515774207] [2025-03-03 14:28:53,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:53,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 14:28:53,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 14:28:53,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:53,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:28:54,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:54,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515774207] [2025-03-03 14:28:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515774207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:54,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:54,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:28:54,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213933823] [2025-03-03 14:28:54,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:54,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:28:54,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:54,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:28:54,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:28:54,030 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03-03 14:28:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:54,049 INFO L93 Difference]: Finished difference Result 141 states and 184 transitions. [2025-03-03 14:28:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:28:54,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2025-03-03 14:28:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:54,051 INFO L225 Difference]: With dead ends: 141 [2025-03-03 14:28:54,053 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 14:28:54,053 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-03-03 14:28:54,054 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 93 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-03-03 14:28:54,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 14:28:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-03 14:28:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.309090909090909) internal successors, (72), 62 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 14:28:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2025-03-03 14:28:54,063 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 27 [2025-03-03 14:28:54,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:54,063 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2025-03-03 14:28:54,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03-03 14:28:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2025-03-03 14:28:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:28:54,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:54,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:54,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:28:54,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:54,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1612681641, now seen corresponding path program 1 times [2025-03-03 14:28:54,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:54,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770879570] [2025-03-03 14:28:54,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:54,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:54,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:28:54,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:28:54,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:28:54,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770879570] [2025-03-03 14:28:54,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770879570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:54,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:54,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:28:54,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229156961] [2025-03-03 14:28:54,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:54,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:28:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:54,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:28:54,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:28:54,135 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:28:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:54,363 INFO L93 Difference]: Finished difference Result 217 states and 274 transitions. [2025-03-03 14:28:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:28:54,363 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), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2025-03-03 14:28:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:54,364 INFO L225 Difference]: With dead ends: 217 [2025-03-03 14:28:54,364 INFO L226 Difference]: Without dead ends: 150 [2025-03-03 14:28:54,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:28:54,365 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 183 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:54,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 251 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:28:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-03 14:28:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2025-03-03 14:28:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 115 states have internal predecessors, (134), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2025-03-03 14:28:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2025-03-03 14:28:54,385 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 37 [2025-03-03 14:28:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:54,385 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2025-03-03 14:28:54,385 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), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:28:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2025-03-03 14:28:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 14:28:54,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:54,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:28:54,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:54,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1911065699, now seen corresponding path program 1 times [2025-03-03 14:28:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502654791] [2025-03-03 14:28:54,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:54,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:28:54,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:28:54,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:54,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:28:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:54,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502654791] [2025-03-03 14:28:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502654791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:54,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:28:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767702143] [2025-03-03 14:28:54,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:54,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:28:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:54,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:28:54,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:28:54,472 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-03-03 14:28:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:54,568 INFO L93 Difference]: Finished difference Result 508 states and 653 transitions. [2025-03-03 14:28:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:28:54,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 43 [2025-03-03 14:28:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:54,573 INFO L225 Difference]: With dead ends: 508 [2025-03-03 14:28:54,575 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 14:28:54,577 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-03-03 14:28:54,577 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 138 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:54,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 290 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:28:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 14:28:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 362. [2025-03-03 14:28:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 269 states have (on average 1.2565055762081785) internal successors, (338), 287 states have internal predecessors, (338), 46 states have call successors, (46), 39 states have call predecessors, (46), 46 states have return successors, (73), 49 states have call predecessors, (73), 46 states have call successors, (73) [2025-03-03 14:28:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 457 transitions. [2025-03-03 14:28:54,640 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 457 transitions. Word has length 43 [2025-03-03 14:28:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:54,640 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 457 transitions. [2025-03-03 14:28:54,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-03-03 14:28:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 457 transitions. [2025-03-03 14:28:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 14:28:54,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:54,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:54,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:28:54,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:54,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1692210981, now seen corresponding path program 1 times [2025-03-03 14:28:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:54,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863460261] [2025-03-03 14:28:54,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:54,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:28:54,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:28:54,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:54,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:28:54,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:54,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863460261] [2025-03-03 14:28:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863460261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:54,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:54,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:28:54,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366943918] [2025-03-03 14:28:54,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:54,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:28:54,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:54,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:28:54,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:28:54,748 INFO L87 Difference]: Start difference. First operand 362 states and 457 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:28:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:54,928 INFO L93 Difference]: Finished difference Result 366 states and 459 transitions. [2025-03-03 14:28:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:28:54,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-03 14:28:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:54,931 INFO L225 Difference]: With dead ends: 366 [2025-03-03 14:28:54,932 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 14:28:54,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:28:54,932 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 126 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:54,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 293 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:28:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 14:28:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2025-03-03 14:28:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 269 states have (on average 1.237918215613383) internal successors, (333), 287 states have internal predecessors, (333), 46 states have call successors, (46), 39 states have call predecessors, (46), 46 states have return successors, (73), 49 states have call predecessors, (73), 46 states have call successors, (73) [2025-03-03 14:28:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 452 transitions. [2025-03-03 14:28:54,968 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 452 transitions. Word has length 43 [2025-03-03 14:28:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:54,968 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 452 transitions. [2025-03-03 14:28:54,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:28:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 452 transitions. [2025-03-03 14:28:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:28:54,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:54,972 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] [2025-03-03 14:28:54,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:28:54,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:54,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 861069816, now seen corresponding path program 1 times [2025-03-03 14:28:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:54,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615591628] [2025-03-03 14:28:54,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:54,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:28:54,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:28:54,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:28:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:55,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615591628] [2025-03-03 14:28:55,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615591628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:55,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:28:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021010694] [2025-03-03 14:28:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:55,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:28:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:55,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:28:55,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:28:55,057 INFO L87 Difference]: Start difference. First operand 362 states and 452 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:28:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:55,087 INFO L93 Difference]: Finished difference Result 726 states and 933 transitions. [2025-03-03 14:28:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:28:55,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-03 14:28:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:55,090 INFO L225 Difference]: With dead ends: 726 [2025-03-03 14:28:55,090 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 14:28:55,091 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-03-03 14:28:55,092 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 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-03-03 14:28:55,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 14:28:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-03-03 14:28:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 278 states have (on average 1.2302158273381294) internal successors, (342), 296 states have internal predecessors, (342), 46 states have call successors, (46), 39 states have call predecessors, (46), 46 states have return successors, (73), 49 states have call predecessors, (73), 46 states have call successors, (73) [2025-03-03 14:28:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 461 transitions. [2025-03-03 14:28:55,121 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 461 transitions. Word has length 53 [2025-03-03 14:28:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:55,121 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 461 transitions. [2025-03-03 14:28:55,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:28:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 461 transitions. [2025-03-03 14:28:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:28:55,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:55,123 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] [2025-03-03 14:28:55,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:28:55,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:55,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash 872385943, now seen corresponding path program 1 times [2025-03-03 14:28:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:55,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606690266] [2025-03-03 14:28:55,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:55,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:28:55,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:28:55,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:55,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:28:55,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:55,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606690266] [2025-03-03 14:28:55,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606690266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:55,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:55,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:28:55,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197205973] [2025-03-03 14:28:55,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:55,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:28:55,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:55,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:28:55,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:28:55,202 INFO L87 Difference]: Start difference. First operand 371 states and 461 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:28:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:55,236 INFO L93 Difference]: Finished difference Result 662 states and 837 transitions. [2025-03-03 14:28:55,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:28:55,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-03 14:28:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:55,239 INFO L225 Difference]: With dead ends: 662 [2025-03-03 14:28:55,239 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 14:28:55,241 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-03-03 14:28:55,241 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:55,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:28:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 14:28:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-03 14:28:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 223 states have (on average 1.2152466367713004) internal successors, (271), 237 states have internal predecessors, (271), 37 states have call successors, (37), 32 states have call predecessors, (37), 37 states have return successors, (56), 39 states have call predecessors, (56), 37 states have call successors, (56) [2025-03-03 14:28:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 364 transitions. [2025-03-03 14:28:55,270 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 364 transitions. Word has length 53 [2025-03-03 14:28:55,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:55,271 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 364 transitions. [2025-03-03 14:28:55,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:28:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 364 transitions. [2025-03-03 14:28:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:28:55,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:55,272 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, 1] [2025-03-03 14:28:55,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:28:55,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:55,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash -865956393, now seen corresponding path program 1 times [2025-03-03 14:28:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098843053] [2025-03-03 14:28:55,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:55,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:28:55,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:28:55,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:55,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:28:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:55,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098843053] [2025-03-03 14:28:55,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098843053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:55,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:28:55,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:28:55,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788055915] [2025-03-03 14:28:55,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:55,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:28:55,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:55,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:28:55,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:28:55,437 INFO L87 Difference]: Start difference. First operand 298 states and 364 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:28:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:55,666 INFO L93 Difference]: Finished difference Result 844 states and 1075 transitions. [2025-03-03 14:28:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:28:55,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-03-03 14:28:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:55,670 INFO L225 Difference]: With dead ends: 844 [2025-03-03 14:28:55,670 INFO L226 Difference]: Without dead ends: 553 [2025-03-03 14:28:55,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:28:55,674 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 75 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:55,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 647 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:28:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-03 14:28:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-03 14:28:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 408 states have (on average 1.1887254901960784) internal successors, (485), 433 states have internal predecessors, (485), 73 states have call successors, (73), 63 states have call predecessors, (73), 71 states have return successors, (116), 76 states have call predecessors, (116), 73 states have call successors, (116) [2025-03-03 14:28:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 674 transitions. [2025-03-03 14:28:55,734 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 674 transitions. Word has length 57 [2025-03-03 14:28:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:55,735 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 674 transitions. [2025-03-03 14:28:55,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:28:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 674 transitions. [2025-03-03 14:28:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:28:55,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:55,738 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2025-03-03 14:28:55,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:28:55,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:55,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1636208169, now seen corresponding path program 1 times [2025-03-03 14:28:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:55,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58013113] [2025-03-03 14:28:55,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:55,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:28:55,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:28:55,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:55,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:28:55,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58013113] [2025-03-03 14:28:55,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58013113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:28:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420684001] [2025-03-03 14:28:55,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:55,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:28:55,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:28:55,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:28:55,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:28:55,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:28:55,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:28:55,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:55,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:55,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:28:56,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:28:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:28:56,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:28:56,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420684001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:56,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:28:56,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-03 14:28:56,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204095984] [2025-03-03 14:28:56,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:56,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:28:56,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:56,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:28:56,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:28:56,086 INFO L87 Difference]: Start difference. First operand 553 states and 674 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:28:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:56,334 INFO L93 Difference]: Finished difference Result 1130 states and 1419 transitions. [2025-03-03 14:28:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:28:56,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2025-03-03 14:28:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:56,339 INFO L225 Difference]: With dead ends: 1130 [2025-03-03 14:28:56,339 INFO L226 Difference]: Without dead ends: 672 [2025-03-03 14:28:56,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:28:56,342 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 132 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:56,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 262 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:28:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-03 14:28:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2025-03-03 14:28:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 494 states have (on average 1.1963562753036436) internal successors, (591), 523 states have internal predecessors, (591), 90 states have call successors, (90), 80 states have call predecessors, (90), 85 states have return successors, (151), 91 states have call predecessors, (151), 90 states have call successors, (151) [2025-03-03 14:28:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 832 transitions. [2025-03-03 14:28:56,420 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 832 transitions. Word has length 108 [2025-03-03 14:28:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:56,420 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 832 transitions. [2025-03-03 14:28:56,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:28:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 832 transitions. [2025-03-03 14:28:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:28:56,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:28:56,426 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:56,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:28:56,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:28:56,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:28:56,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:28:56,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1077953685, now seen corresponding path program 1 times [2025-03-03 14:28:56,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:28:56,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078561792] [2025-03-03 14:28:56,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:28:56,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:28:56,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:28:56,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:56,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:28:56,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:28:56,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078561792] [2025-03-03 14:28:56,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078561792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:28:56,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866864930] [2025-03-03 14:28:56,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:28:56,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:28:56,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:28:56,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:28:56,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:28:56,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:28:56,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:28:56,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:28:56,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:28:56,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:28:56,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:28:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:28:56,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:28:56,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866864930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:28:56,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:28:56,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-03 14:28:56,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849052199] [2025-03-03 14:28:56,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:28:56,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:28:56,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:28:56,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:28:56,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:28:56,949 INFO L87 Difference]: Start difference. First operand 670 states and 832 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:28:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:28:57,074 INFO L93 Difference]: Finished difference Result 1417 states and 1757 transitions. [2025-03-03 14:28:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:28:57,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-03 14:28:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:28:57,076 INFO L225 Difference]: With dead ends: 1417 [2025-03-03 14:28:57,076 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:28:57,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:28:57,079 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 56 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:28:57,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 876 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:28:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:28:57,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:28:57,080 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-03-03 14:28:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:28:57,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2025-03-03 14:28:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:28:57,081 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:28:57,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:28:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:28:57,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:28:57,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:28:57,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:28:57,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:28:57,286 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:28:57,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:29:00,044 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:29:00,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:29:00 BoogieIcfgContainer [2025-03-03 14:29:00,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:29:00,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:29:00,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:29:00,053 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:29:00,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:28:53" (3/4) ... [2025-03-03 14:29:00,055 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:29:00,058 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-03-03 14:29:00,058 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-03-03 14:29:00,058 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-03-03 14:29:00,059 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-03-03 14:29:00,059 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-03-03 14:29:00,059 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-03-03 14:29:00,059 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2025-03-03 14:29:00,059 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2025-03-03 14:29:00,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-03 14:29:00,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-03 14:29:00,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-03 14:29:00,063 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:29:00,063 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:29:00,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:29:00,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:29:00,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:29:00,130 INFO L158 Benchmark]: Toolchain (without parser) took 7355.62ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.7MB in the beginning and 166.8MB in the end (delta: -54.1MB). Peak memory consumption was 230.8MB. Max. memory is 16.1GB. [2025-03-03 14:29:00,130 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:29:00,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.61ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 94.3MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:29:00,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.42ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:29:00,130 INFO L158 Benchmark]: Boogie Preprocessor took 30.53ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:29:00,131 INFO L158 Benchmark]: IcfgBuilder took 331.45ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 72.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:29:00,131 INFO L158 Benchmark]: TraceAbstraction took 6514.71ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 71.9MB in the beginning and 175.0MB in the end (delta: -103.1MB). Peak memory consumption was 200.0MB. Max. memory is 16.1GB. [2025-03-03 14:29:00,131 INFO L158 Benchmark]: Witness Printer took 76.64ms. Allocated memory is still 427.8MB. Free memory was 175.0MB in the beginning and 166.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:29:00,132 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.18ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.61ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 94.3MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.42ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.53ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 331.45ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 72.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6514.71ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 71.9MB in the beginning and 175.0MB in the end (delta: -103.1MB). Peak memory consumption was 200.0MB. Max. memory is 16.1GB. * Witness Printer took 76.64ms. Allocated memory is still 427.8MB. Free memory was 175.0MB in the beginning and 166.8MB in the end (delta: 8.3MB). 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: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] - GenericResultAtLocation [Line: 159]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [159] - GenericResultAtLocation [Line: 186]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [186] - GenericResultAtLocation [Line: 288]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [288] - GenericResultAtLocation [Line: 323]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [323] - GenericResultAtLocation [Line: 689]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [689] - GenericResultAtLocation [Line: 754]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [754] * 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: 155]: 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, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 799 mSDsluCounter, 3629 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2469 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 1160 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=10, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 771 ConstructedInterpolants, 0 QuantifiedInterpolants, 1273 SizeOfPredicates, 1 NumberOfNonLiveVariables, 663 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 176/189 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: 700]: Location Invariant Derived location invariant: ((((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 199]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-03-03 14:29:00,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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