./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product40.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_spec2_product40.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 1b223e2286b1d2d2d4710f5bd529ee4610cfb9619424734c12c9aa00d3c99444 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:39:24,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:39:24,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:39:24,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:39:24,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:39:24,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:39:24,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:39:24,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:39:24,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:39:24,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:39:24,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:39:24,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:39:24,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:39:24,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:39:24,427 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:39:24,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:39:24,428 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:39:24,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:39:24,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:39:24,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:39:24,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:39:24,429 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:39:24,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:39:24,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:39:24,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:39:24,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:39:24,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:39:24,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:39:24,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:39:24,430 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 -> 1b223e2286b1d2d2d4710f5bd529ee4610cfb9619424734c12c9aa00d3c99444 [2025-03-08 05:39:24,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:39:24,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:39:24,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:39:24,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:39:24,710 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:39:24,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product40.cil.c [2025-03-08 05:39:25,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb7f0787/563f03df7d8a41c08daf7524e330284a/FLAGae1182a45 [2025-03-08 05:39:26,125 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:39:26,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product40.cil.c [2025-03-08 05:39:26,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb7f0787/563f03df7d8a41c08daf7524e330284a/FLAGae1182a45 [2025-03-08 05:39:26,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb7f0787/563f03df7d8a41c08daf7524e330284a [2025-03-08 05:39:26,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:39:26,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:39:26,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:39:26,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:39:26,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:39:26,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e2fbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26, skipping insertion in model container [2025-03-08 05:39:26,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:39:26,708 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_spec2_product40.cil.c[17002,17015] [2025-03-08 05:39:26,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:39:26,731 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:39:26,737 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [49] [2025-03-08 05:39:26,738 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [91] [2025-03-08 05:39:26,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [191] [2025-03-08 05:39:26,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [264] [2025-03-08 05:39:26,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [468] [2025-03-08 05:39:26,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [834] [2025-03-08 05:39:26,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [843] [2025-03-08 05:39:26,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [943] [2025-03-08 05:39:26,781 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_spec2_product40.cil.c[17002,17015] [2025-03-08 05:39:26,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:39:26,800 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:39:26,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26 WrapperNode [2025-03-08 05:39:26,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:39:26,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:39:26,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:39:26,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:39:26,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,827 INFO L138 Inliner]: procedures = 56, calls = 101, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 197 [2025-03-08 05:39:26,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:39:26,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:39:26,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:39:26,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:39:26,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,855 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-08 05:39:26,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:39:26,867 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:39:26,868 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:39:26,868 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:39:26,870 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (1/1) ... [2025-03-08 05:39:26,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:39:26,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:26,893 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-08 05:39:26,897 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-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-08 05:39:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:39:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:39:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-08 05:39:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:39:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-08 05:39:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-08 05:39:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-08 05:39:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-08 05:39:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:39:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:39:26,968 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:39:26,970 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:39:27,097 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L378-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~3#1; [2025-03-08 05:39:27,097 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L387-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~4#1; [2025-03-08 05:39:27,103 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L142: #res := ~retValue_acc~0; [2025-03-08 05:39:27,171 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L975-1: valid_product_#res#1 := valid_product_~retValue_acc~11#1; [2025-03-08 05:39:27,171 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L940-1: main_#res#1 := main_~retValue_acc~9#1; [2025-03-08 05:39:27,200 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L188-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2025-03-08 05:39:27,200 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L442-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~5#1; [2025-03-08 05:39:27,223 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-08 05:39:27,225 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:39:27,234 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:39:27,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:39:27,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:27 BoogieIcfgContainer [2025-03-08 05:39:27,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:39:27,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:39:27,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:39:27,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:39:27,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:39:26" (1/3) ... [2025-03-08 05:39:27,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624c35c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:39:27, skipping insertion in model container [2025-03-08 05:39:27,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:26" (2/3) ... [2025-03-08 05:39:27,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624c35c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:39:27, skipping insertion in model container [2025-03-08 05:39:27,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:27" (3/3) ... [2025-03-08 05:39:27,243 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product40.cil.c [2025-03-08 05:39:27,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:39:27,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product40.cil.c that has 9 procedures, 92 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:39:27,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:39:27,314 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;@3d2756d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:39:27,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:39:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 77 states have internal predecessors, (93), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 05:39:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 05:39:27,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:27,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:27,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:27,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2021602475, now seen corresponding path program 1 times [2025-03-08 05:39:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:27,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403471468] [2025-03-08 05:39:27,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:27,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 05:39:27,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 05:39:27,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:27,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:27,513 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-08 05:39:27,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403471468] [2025-03-08 05:39:27,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403471468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:27,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:27,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:39:27,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008089032] [2025-03-08 05:39:27,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:27,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:27,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:27,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:27,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:27,533 INFO L87 Difference]: Start difference. First operand has 92 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 77 states have internal predecessors, (93), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:27,559 INFO L93 Difference]: Finished difference Result 163 states and 217 transitions. [2025-03-08 05:39:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:27,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 05:39:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:27,566 INFO L225 Difference]: With dead ends: 163 [2025-03-08 05:39:27,566 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 05:39:27,568 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-08 05:39:27,570 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 180 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-08 05:39:27,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 180 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 05:39:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-08 05:39:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 64 states have internal predecessors, (75), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 05:39:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2025-03-08 05:39:27,617 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 25 [2025-03-08 05:39:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:27,618 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2025-03-08 05:39:27,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2025-03-08 05:39:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 05:39:27,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:27,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:27,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:39:27,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:27,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash -694443066, now seen corresponding path program 1 times [2025-03-08 05:39:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:27,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140470684] [2025-03-08 05:39:27,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:27,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 05:39:27,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 05:39:27,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:27,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:27,739 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-08 05:39:27,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:27,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140470684] [2025-03-08 05:39:27,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140470684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:27,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:27,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:39:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092703975] [2025-03-08 05:39:27,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:27,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:27,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:27,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:27,741 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:27,782 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2025-03-08 05:39:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:27,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-08 05:39:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:27,785 INFO L225 Difference]: With dead ends: 207 [2025-03-08 05:39:27,786 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 05:39:27,787 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-08 05:39:27,787 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 76 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:27,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 05:39:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2025-03-08 05:39:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 100 states have (on average 1.37) internal successors, (137), 115 states have internal predecessors, (137), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 05:39:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2025-03-08 05:39:27,808 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 29 [2025-03-08 05:39:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:27,808 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2025-03-08 05:39:27,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2025-03-08 05:39:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 05:39:27,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:27,809 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] [2025-03-08 05:39:27,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:39:27,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:27,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:27,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1468351499, now seen corresponding path program 1 times [2025-03-08 05:39:27,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:27,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423626387] [2025-03-08 05:39:27,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:27,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:27,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 05:39:27,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 05:39:27,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:27,936 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-08 05:39:27,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:27,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423626387] [2025-03-08 05:39:27,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423626387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:27,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:27,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:39:27,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315940055] [2025-03-08 05:39:27,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:27,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:39:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:27,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:39:27,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:39:27,938 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:28,019 INFO L93 Difference]: Finished difference Result 345 states and 468 transitions. [2025-03-08 05:39:28,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:39:28,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-08 05:39:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:28,022 INFO L225 Difference]: With dead ends: 345 [2025-03-08 05:39:28,022 INFO L226 Difference]: Without dead ends: 216 [2025-03-08 05:39:28,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:39:28,023 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:28,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 341 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-08 05:39:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2025-03-08 05:39:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 173 states have internal predecessors, (210), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-03-08 05:39:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 278 transitions. [2025-03-08 05:39:28,042 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 278 transitions. Word has length 32 [2025-03-08 05:39:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:28,042 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 278 transitions. [2025-03-08 05:39:28,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 278 transitions. [2025-03-08 05:39:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:39:28,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:28,043 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-08 05:39:28,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:39:28,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:28,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash 632544043, now seen corresponding path program 1 times [2025-03-08 05:39:28,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687161625] [2025-03-08 05:39:28,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:28,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:28,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:39:28,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:39:28,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:28,106 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-08 05:39:28,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:28,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687161625] [2025-03-08 05:39:28,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687161625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:28,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:28,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:39:28,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652129112] [2025-03-08 05:39:28,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:28,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:39:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:28,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:39:28,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:39:28,108 INFO L87 Difference]: Start difference. First operand 215 states and 278 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:39:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:28,133 INFO L93 Difference]: Finished difference Result 426 states and 570 transitions. [2025-03-08 05:39:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:39:28,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-08 05:39:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:28,135 INFO L225 Difference]: With dead ends: 426 [2025-03-08 05:39:28,135 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 05:39:28,136 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-08 05:39:28,136 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 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-08 05:39:28,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 05:39:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-08 05:39:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 177 states have internal predecessors, (214), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-03-08 05:39:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 282 transitions. [2025-03-08 05:39:28,153 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 282 transitions. Word has length 43 [2025-03-08 05:39:28,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:28,153 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 282 transitions. [2025-03-08 05:39:28,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:39:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2025-03-08 05:39:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:39:28,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:28,154 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-08 05:39:28,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:39:28,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:28,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1477015914, now seen corresponding path program 1 times [2025-03-08 05:39:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:28,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140877196] [2025-03-08 05:39:28,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:28,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:28,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:39:28,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:39:28,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:28,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:28,233 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-08 05:39:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140877196] [2025-03-08 05:39:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140877196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:28,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:28,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:39:28,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864520196] [2025-03-08 05:39:28,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:28,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:39:28,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:28,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:39:28,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:39:28,235 INFO L87 Difference]: Start difference. First operand 219 states and 282 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:39:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:28,264 INFO L93 Difference]: Finished difference Result 436 states and 572 transitions. [2025-03-08 05:39:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:39:28,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-08 05:39:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:28,267 INFO L225 Difference]: With dead ends: 436 [2025-03-08 05:39:28,267 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 05:39:28,268 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-08 05:39:28,268 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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-08 05:39:28,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 05:39:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-08 05:39:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 168 states have (on average 1.3095238095238095) internal successors, (220), 183 states have internal predecessors, (220), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-03-08 05:39:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 288 transitions. [2025-03-08 05:39:28,288 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 288 transitions. Word has length 43 [2025-03-08 05:39:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:28,289 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 288 transitions. [2025-03-08 05:39:28,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:39:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 288 transitions. [2025-03-08 05:39:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:39:28,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:28,290 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-08 05:39:28,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:39:28,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:28,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1055245869, now seen corresponding path program 1 times [2025-03-08 05:39:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:28,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285196771] [2025-03-08 05:39:28,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:28,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:28,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:39:28,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:39:28,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:28,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:28,388 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-08 05:39:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285196771] [2025-03-08 05:39:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285196771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:28,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:39:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715457963] [2025-03-08 05:39:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:28,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:39:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:28,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:39:28,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:39:28,389 INFO L87 Difference]: Start difference. First operand 225 states and 288 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:39:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:28,534 INFO L93 Difference]: Finished difference Result 739 states and 977 transitions. [2025-03-08 05:39:28,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:39:28,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-08 05:39:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:28,538 INFO L225 Difference]: With dead ends: 739 [2025-03-08 05:39:28,538 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 05:39:28,539 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-08 05:39:28,539 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 127 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:28,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 315 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 05:39:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 510. [2025-03-08 05:39:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 379 states have (on average 1.2823218997361479) internal successors, (486), 408 states have internal predecessors, (486), 68 states have call successors, (68), 60 states have call predecessors, (68), 62 states have return successors, (104), 64 states have call predecessors, (104), 68 states have call successors, (104) [2025-03-08 05:39:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 658 transitions. [2025-03-08 05:39:28,577 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 658 transitions. Word has length 43 [2025-03-08 05:39:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:28,577 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 658 transitions. [2025-03-08 05:39:28,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:39:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 658 transitions. [2025-03-08 05:39:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 05:39:28,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:28,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:28,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:39:28,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:28,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1416443121, now seen corresponding path program 1 times [2025-03-08 05:39:28,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:28,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499687991] [2025-03-08 05:39:28,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:28,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 05:39:28,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 05:39:28,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:28,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:28,626 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-08 05:39:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499687991] [2025-03-08 05:39:28,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499687991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:28,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:28,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:39:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987770683] [2025-03-08 05:39:28,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:28,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:28,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:28,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:28,627 INFO L87 Difference]: Start difference. First operand 510 states and 658 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:39:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:28,667 INFO L93 Difference]: Finished difference Result 844 states and 1124 transitions. [2025-03-08 05:39:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-08 05:39:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:28,672 INFO L225 Difference]: With dead ends: 844 [2025-03-08 05:39:28,672 INFO L226 Difference]: Without dead ends: 842 [2025-03-08 05:39:28,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:28,673 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:28,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 181 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-08 05:39:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 802. [2025-03-08 05:39:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 591 states have (on average 1.2893401015228427) internal successors, (762), 642 states have internal predecessors, (762), 112 states have call successors, (112), 96 states have call predecessors, (112), 98 states have return successors, (201), 98 states have call predecessors, (201), 112 states have call successors, (201) [2025-03-08 05:39:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1075 transitions. [2025-03-08 05:39:28,733 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1075 transitions. Word has length 47 [2025-03-08 05:39:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:28,734 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1075 transitions. [2025-03-08 05:39:28,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:39:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1075 transitions. [2025-03-08 05:39:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:39:28,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:28,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:39:28,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:39:28,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:28,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1626431163, now seen corresponding path program 1 times [2025-03-08 05:39:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960255965] [2025-03-08 05:39:28,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:28,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:39:28,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:39:28,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:28,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:39:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960255965] [2025-03-08 05:39:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960255965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:28,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:28,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:39:28,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291718147] [2025-03-08 05:39:28,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:28,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:39:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:28,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:39:28,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:39:28,815 INFO L87 Difference]: Start difference. First operand 802 states and 1075 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:39:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:28,924 INFO L93 Difference]: Finished difference Result 1306 states and 1749 transitions. [2025-03-08 05:39:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:39:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 79 [2025-03-08 05:39:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:28,929 INFO L225 Difference]: With dead ends: 1306 [2025-03-08 05:39:28,929 INFO L226 Difference]: Without dead ends: 512 [2025-03-08 05:39:28,931 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-08 05:39:28,933 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 116 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:28,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 231 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-08 05:39:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 484. [2025-03-08 05:39:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 363 states have (on average 1.2699724517906337) internal successors, (461), 390 states have internal predecessors, (461), 62 states have call successors, (62), 56 states have call predecessors, (62), 58 states have return successors, (105), 60 states have call predecessors, (105), 62 states have call successors, (105) [2025-03-08 05:39:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 628 transitions. [2025-03-08 05:39:28,988 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 628 transitions. Word has length 79 [2025-03-08 05:39:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:28,988 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 628 transitions. [2025-03-08 05:39:28,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:39:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 628 transitions. [2025-03-08 05:39:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:39:28,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:28,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:28,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:39:28,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:28,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1392726678, now seen corresponding path program 1 times [2025-03-08 05:39:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388845394] [2025-03-08 05:39:28,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:29,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:39:29,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:39:29,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:29,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:39:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:29,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388845394] [2025-03-08 05:39:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388845394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:29,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918772329] [2025-03-08 05:39:29,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:29,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:29,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:29,141 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-08 05:39:29,143 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-08 05:39:29,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:39:29,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:39:29,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:29,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:29,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:39:29,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:39:29,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:39:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918772329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:29,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:39:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:39:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348336649] [2025-03-08 05:39:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:29,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:29,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:29,276 INFO L87 Difference]: Start difference. First operand 484 states and 628 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:39:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:29,353 INFO L93 Difference]: Finished difference Result 1049 states and 1417 transitions. [2025-03-08 05:39:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:29,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 90 [2025-03-08 05:39:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:29,358 INFO L225 Difference]: With dead ends: 1049 [2025-03-08 05:39:29,358 INFO L226 Difference]: Without dead ends: 649 [2025-03-08 05:39:29,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:29,377 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 73 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:29,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 267 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:29,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-08 05:39:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 545. [2025-03-08 05:39:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 410 states have (on average 1.273170731707317) internal successors, (522), 436 states have internal predecessors, (522), 69 states have call successors, (69), 63 states have call predecessors, (69), 65 states have return successors, (99), 66 states have call predecessors, (99), 69 states have call successors, (99) [2025-03-08 05:39:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 690 transitions. [2025-03-08 05:39:29,425 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 690 transitions. Word has length 90 [2025-03-08 05:39:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:29,425 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 690 transitions. [2025-03-08 05:39:29,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:39:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 690 transitions. [2025-03-08 05:39:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:39:29,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:29,428 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:29,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:39:29,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:29,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:29,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:29,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2120764168, now seen corresponding path program 1 times [2025-03-08 05:39:29,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:29,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213000079] [2025-03-08 05:39:29,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:29,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:39:29,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:39:29,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:29,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:39:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213000079] [2025-03-08 05:39:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213000079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:29,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853311361] [2025-03-08 05:39:29,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:29,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:29,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:29,790 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-08 05:39:29,790 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-08 05:39:29,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:39:29,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:39:29,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:29,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:29,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:39:29,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:39:29,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:39:29,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853311361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:29,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:39:29,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 05:39:29,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806120112] [2025-03-08 05:39:29,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:29,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:29,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:29,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:39:29,935 INFO L87 Difference]: Start difference. First operand 545 states and 690 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:39:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:29,991 INFO L93 Difference]: Finished difference Result 959 states and 1237 transitions. [2025-03-08 05:39:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2025-03-08 05:39:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:29,995 INFO L225 Difference]: With dead ends: 959 [2025-03-08 05:39:29,995 INFO L226 Difference]: Without dead ends: 494 [2025-03-08 05:39:29,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:39:29,996 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:29,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 202 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-08 05:39:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2025-03-08 05:39:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 370 states have (on average 1.2459459459459459) internal successors, (461), 394 states have internal predecessors, (461), 64 states have call successors, (64), 58 states have call predecessors, (64), 59 states have return successors, (83), 62 states have call predecessors, (83), 64 states have call successors, (83) [2025-03-08 05:39:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 608 transitions. [2025-03-08 05:39:30,049 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 608 transitions. Word has length 84 [2025-03-08 05:39:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:30,050 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 608 transitions. [2025-03-08 05:39:30,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:39:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 608 transitions. [2025-03-08 05:39:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 05:39:30,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:30,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:30,073 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-08 05:39:30,253 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,SelfDestructingSolverStorable9 [2025-03-08 05:39:30,254 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:30,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 792082065, now seen corresponding path program 1 times [2025-03-08 05:39:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646602620] [2025-03-08 05:39:30,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:30,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:39:30,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:39:30,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:30,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:39:30,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:30,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646602620] [2025-03-08 05:39:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646602620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:30,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057086193] [2025-03-08 05:39:30,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:30,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:30,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:30,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:39:30,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:39:30,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:39:30,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:39:30,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:30,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:30,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:39:30,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:39:30,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:39:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:39:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057086193] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:30,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:39:30,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 10 [2025-03-08 05:39:30,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747551086] [2025-03-08 05:39:30,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:30,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:39:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:30,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:39:30,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:39:30,657 INFO L87 Difference]: Start difference. First operand 494 states and 608 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:39:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:30,787 INFO L93 Difference]: Finished difference Result 1402 states and 1767 transitions. [2025-03-08 05:39:30,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:39:30,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 89 [2025-03-08 05:39:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:30,793 INFO L225 Difference]: With dead ends: 1402 [2025-03-08 05:39:30,793 INFO L226 Difference]: Without dead ends: 916 [2025-03-08 05:39:30,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:39:30,795 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 57 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:30,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 430 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-03-08 05:39:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 853. [2025-03-08 05:39:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 632 states have (on average 1.2151898734177216) internal successors, (768), 677 states have internal predecessors, (768), 113 states have call successors, (113), 103 states have call predecessors, (113), 107 states have return successors, (151), 108 states have call predecessors, (151), 113 states have call successors, (151) [2025-03-08 05:39:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1032 transitions. [2025-03-08 05:39:30,855 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1032 transitions. Word has length 89 [2025-03-08 05:39:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:30,856 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1032 transitions. [2025-03-08 05:39:30,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:39:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1032 transitions. [2025-03-08 05:39:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:39:30,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:30,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:30,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:39:31,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:31,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1358992594, now seen corresponding path program 1 times [2025-03-08 05:39:31,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:31,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602909226] [2025-03-08 05:39:31,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:31,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:39:31,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:39:31,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:31,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:39:31,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:31,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602909226] [2025-03-08 05:39:31,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602909226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:31,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018947015] [2025-03-08 05:39:31,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:31,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:31,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:31,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:39:31,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:39:31,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:39:31,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:39:31,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:31,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:31,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:39:31,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:39:31,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:39:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018947015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:31,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:39:31,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-08 05:39:31,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903615205] [2025-03-08 05:39:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:31,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:39:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:31,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:39:31,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:39:31,383 INFO L87 Difference]: Start difference. First operand 853 states and 1032 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:39:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:31,501 INFO L93 Difference]: Finished difference Result 1583 states and 1918 transitions. [2025-03-08 05:39:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:39:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 93 [2025-03-08 05:39:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:31,503 INFO L225 Difference]: With dead ends: 1583 [2025-03-08 05:39:31,503 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:39:31,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:39:31,506 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 34 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:31,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 863 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:39:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:39:31,506 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-08 05:39:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:39:31,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2025-03-08 05:39:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:31,508 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:39:31,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:39:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:39:31,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:39:31,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:39:31,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:39:31,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:31,713 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:31,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:39:36,926 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:39:36,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:39:36 BoogieIcfgContainer [2025-03-08 05:39:36,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:39:36,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:39:36,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:39:36,936 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:39:36,937 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:27" (3/4) ... [2025-03-08 05:39:36,938 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:39:36,945 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-03-08 05:39:36,945 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-03-08 05:39:36,945 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-03-08 05:39:36,945 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-03-08 05:39:36,945 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-03-08 05:39:36,945 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-03-08 05:39:36,945 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:39:36,945 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-03-08 05:39:36,950 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-08 05:39:36,950 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 05:39:36,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 05:39:36,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:39:36,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:39:37,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:39:37,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:39:37,029 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:39:37,030 INFO L158 Benchmark]: Toolchain (without parser) took 10604.12ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 128.3MB in the beginning and 62.0MB in the end (delta: 66.3MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2025-03-08 05:39:37,030 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 192.9MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:39:37,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.23ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 109.7MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:39:37,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.69ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:39:37,030 INFO L158 Benchmark]: Boogie Preprocessor took 38.50ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 106.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:39:37,030 INFO L158 Benchmark]: IcfgBuilder took 367.78ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 88.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:39:37,031 INFO L158 Benchmark]: TraceAbstraction took 9699.04ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 87.6MB in the beginning and 70.1MB in the end (delta: 17.4MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2025-03-08 05:39:37,031 INFO L158 Benchmark]: Witness Printer took 93.26ms. Allocated memory is still 201.3MB. Free memory was 70.1MB in the beginning and 62.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:39:37,033 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.25ms. Allocated memory is still 192.9MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.23ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 109.7MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.69ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.50ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 106.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 367.78ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 88.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9699.04ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 87.6MB in the beginning and 70.1MB in the end (delta: 17.4MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * Witness Printer took 93.26ms. Allocated memory is still 201.3MB. Free memory was 70.1MB in the beginning and 62.0MB in the end (delta: 8.1MB). 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,"Specification2_spec.i","") [49] - GenericResultAtLocation [Line: 91]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [91] - GenericResultAtLocation [Line: 191]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [191] - GenericResultAtLocation [Line: 264]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [264] - GenericResultAtLocation [Line: 468]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [468] - GenericResultAtLocation [Line: 834]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [834] - GenericResultAtLocation [Line: 843]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [843] - GenericResultAtLocation [Line: 943]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [943] * 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: 839]: 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, 135 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 665 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 659 mSDsluCounter, 3855 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2400 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 1455 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=853occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 251 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1053 NumberOfCodeBlocks, 1053 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1125 ConstructedInterpolants, 0 QuantifiedInterpolants, 2150 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1266 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 301/328 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: 855]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 206]: Location Invariant Derived location invariant: ((((((((((1 <= pumpRunning) && (waterLevel != 1)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (0 == systemActive))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (0 == systemActive))) RESULT: Ultimate proved your program to be correct! [2025-03-08 05:39:37,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE