./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product51.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product51.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 1ef39c14b0f41147d1df64069011556a64ce74ff520b071f62407c2225292c50 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:31:49,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:31:49,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:31:49,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:31:49,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:31:49,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:31:49,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:31:49,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:31:49,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:31:49,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:31:49,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:31:49,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:31:49,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:31:49,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:31:49,306 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:31:49,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:31:49,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:31:49,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:31:49,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:31:49,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:31:49,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:31:49,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:31:49,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:31:49,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:31:49,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:31:49,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:31:49,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:31:49,308 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 -> 1ef39c14b0f41147d1df64069011556a64ce74ff520b071f62407c2225292c50 [2025-03-03 14:31:49,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:31:49,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:31:49,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:31:49,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:31:49,553 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:31:49,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product51.cil.c [2025-03-03 14:31:50,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d177e5e/601a371c89be4607af52540f5f048e06/FLAG92e0ea6dc [2025-03-03 14:31:51,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:31:51,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product51.cil.c [2025-03-03 14:31:51,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d177e5e/601a371c89be4607af52540f5f048e06/FLAG92e0ea6dc [2025-03-03 14:31:51,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88d177e5e/601a371c89be4607af52540f5f048e06 [2025-03-03 14:31:51,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:31:51,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:31:51,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:31:51,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:31:51,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:31:51,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5388c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51, skipping insertion in model container [2025-03-03 14:31:51,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:31:51,576 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_spec5_product51.cil.c[18485,18498] [2025-03-03 14:31:51,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:31:51,591 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:31:51,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [49] [2025-03-03 14:31:51,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [277] [2025-03-03 14:31:51,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [381] [2025-03-03 14:31:51,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [448] [2025-03-03 14:31:51,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [483] [2025-03-03 14:31:51,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [849] [2025-03-03 14:31:51,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [953] [2025-03-03 14:31:51,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [962] [2025-03-03 14:31:51,633 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_spec5_product51.cil.c[18485,18498] [2025-03-03 14:31:51,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:31:51,650 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:31:51,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51 WrapperNode [2025-03-03 14:31:51,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:31:51,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:31:51,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:31:51,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:31:51,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,683 INFO L138 Inliner]: procedures = 58, calls = 103, calls flagged for inlining = 25, calls inlined = 21, statements flattened = 209 [2025-03-03 14:31:51,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:31:51,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:31:51,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:31:51,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:31:51,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,701 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:31:51,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:31:51,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:31:51,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:31:51,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:31:51,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (1/1) ... [2025-03-03 14:31:51,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:31:51,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:31:51,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:31:51,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:31:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:31:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-03 14:31:51,757 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-03 14:31:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:31:51,757 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:31:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:31:51,757 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:31:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-03-03 14:31:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-03-03 14:31:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-03 14:31:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-03 14:31:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2025-03-03 14:31:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2025-03-03 14:31:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-03 14:31:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-03 14:31:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:31:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-03 14:31:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-03 14:31:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:31:51,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:31:51,815 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:31:51,816 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:31:51,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L927-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~11#1; [2025-03-03 14:31:51,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L950-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~13#1; [2025-03-03 14:31:51,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L259-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2025-03-03 14:31:51,978 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L378-1: main_#res#1 := main_~retValue_acc~4#1; [2025-03-03 14:31:51,978 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L480-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-03-03 14:31:51,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L240-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-03-03 14:31:51,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~12#1; [2025-03-03 14:31:52,003 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: #res := ~retValue_acc~1; [2025-03-03 14:31:52,017 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-03 14:31:52,017 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:31:52,025 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:31:52,026 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:31:52,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:31:52 BoogieIcfgContainer [2025-03-03 14:31:52,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:31:52,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:31:52,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:31:52,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:31:52,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:31:51" (1/3) ... [2025-03-03 14:31:52,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba5df69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:31:52, skipping insertion in model container [2025-03-03 14:31:52,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:31:51" (2/3) ... [2025-03-03 14:31:52,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba5df69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:31:52, skipping insertion in model container [2025-03-03 14:31:52,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:31:52" (3/3) ... [2025-03-03 14:31:52,032 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product51.cil.c [2025-03-03 14:31:52,042 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:31:52,043 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec5_product51.cil.c that has 9 procedures, 98 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:31:52,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:31:52,086 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;@39b38bc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:31:52,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:31:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 83 states have internal predecessors, (100), 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-03 14:31:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 14:31:52,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:52,095 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:52,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:52,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1318742406, now seen corresponding path program 1 times [2025-03-03 14:31:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:52,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443066244] [2025-03-03 14:31:52,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:52,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 14:31:52,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 14:31:52,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:52,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:31:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:52,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443066244] [2025-03-03 14:31:52,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443066244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:52,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:31:52,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305772735] [2025-03-03 14:31:52,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:52,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:31:52,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:52,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:31:52,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:31:52,285 INFO L87 Difference]: Start difference. First operand has 98 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 83 states have internal predecessors, (100), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:31:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:52,306 INFO L93 Difference]: Finished difference Result 187 states and 250 transitions. [2025-03-03 14:31:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:31:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-03 14:31:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:52,313 INFO L225 Difference]: With dead ends: 187 [2025-03-03 14:31:52,313 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 14:31:52,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:31:52,320 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:52,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:31:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 14:31:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 14:31:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 75 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 14:31:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2025-03-03 14:31:52,350 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 32 [2025-03-03 14:31:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:52,350 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2025-03-03 14:31:52,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:31:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2025-03-03 14:31:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:31:52,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:52,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:52,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:31:52,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:52,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:52,354 INFO L85 PathProgramCache]: Analyzing trace with hash -64774908, now seen corresponding path program 1 times [2025-03-03 14:31:52,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:52,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417635069] [2025-03-03 14:31:52,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:52,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:31:52,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:31:52,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:52,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:31:52,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:52,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417635069] [2025-03-03 14:31:52,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417635069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:52,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:52,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:31:52,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842201061] [2025-03-03 14:31:52,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:52,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:31:52,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:52,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:31:52,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:31:52,542 INFO L87 Difference]: Start difference. First operand 89 states and 115 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:31:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:52,757 INFO L93 Difference]: Finished difference Result 305 states and 408 transitions. [2025-03-03 14:31:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:31:52,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-03-03 14:31:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:52,759 INFO L225 Difference]: With dead ends: 305 [2025-03-03 14:31:52,759 INFO L226 Difference]: Without dead ends: 224 [2025-03-03 14:31:52,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:31:52,763 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 201 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:52,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 525 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:31:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-03 14:31:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2025-03-03 14:31:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 161 states have (on average 1.3354037267080745) internal successors, (215), 179 states have internal predecessors, (215), 37 states have call successors, (37), 22 states have call predecessors, (37), 19 states have return successors, (37), 26 states have call predecessors, (37), 34 states have call successors, (37) [2025-03-03 14:31:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2025-03-03 14:31:52,791 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 36 [2025-03-03 14:31:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:52,791 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2025-03-03 14:31:52,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:31:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2025-03-03 14:31:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 14:31:52,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:52,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:52,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:31:52,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:52,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1974833298, now seen corresponding path program 1 times [2025-03-03 14:31:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:52,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320032393] [2025-03-03 14:31:52,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:52,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:52,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 14:31:52,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 14:31:52,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:52,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:31:52,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320032393] [2025-03-03 14:31:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320032393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:52,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:31:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709867040] [2025-03-03 14:31:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:52,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:31:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:52,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:31:52,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:31:52,898 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:31:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:53,135 INFO L93 Difference]: Finished difference Result 650 states and 907 transitions. [2025-03-03 14:31:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:31:53,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2025-03-03 14:31:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:53,141 INFO L225 Difference]: With dead ends: 650 [2025-03-03 14:31:53,142 INFO L226 Difference]: Without dead ends: 440 [2025-03-03 14:31:53,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:31:53,147 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 242 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:53,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 388 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:31:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-03 14:31:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 395. [2025-03-03 14:31:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 296 states have (on average 1.2635135135135136) internal successors, (374), 308 states have internal predecessors, (374), 59 states have call successors, (59), 40 states have call predecessors, (59), 39 states have return successors, (88), 58 states have call predecessors, (88), 54 states have call successors, (88) [2025-03-03 14:31:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 521 transitions. [2025-03-03 14:31:53,193 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 521 transitions. Word has length 46 [2025-03-03 14:31:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:53,194 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 521 transitions. [2025-03-03 14:31:53,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:31:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 521 transitions. [2025-03-03 14:31:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 14:31:53,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:53,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:53,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:31:53,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:53,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash -199400376, now seen corresponding path program 1 times [2025-03-03 14:31:53,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:53,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255830526] [2025-03-03 14:31:53,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:53,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 14:31:53,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 14:31:53,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:53,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:31:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255830526] [2025-03-03 14:31:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255830526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:53,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:53,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:31:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072311080] [2025-03-03 14:31:53,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:53,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:31:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:53,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:31:53,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:31:53,315 INFO L87 Difference]: Start difference. First operand 395 states and 521 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:31:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:53,426 INFO L93 Difference]: Finished difference Result 777 states and 1050 transitions. [2025-03-03 14:31:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:31:53,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-03 14:31:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:53,429 INFO L225 Difference]: With dead ends: 777 [2025-03-03 14:31:53,429 INFO L226 Difference]: Without dead ends: 390 [2025-03-03 14:31:53,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:31:53,433 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 82 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:53,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 521 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:31:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-03 14:31:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-03 14:31:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 291 states have (on average 1.2336769759450172) internal successors, (359), 303 states have internal predecessors, (359), 59 states have call successors, (59), 40 states have call predecessors, (59), 39 states have return successors, (88), 58 states have call predecessors, (88), 54 states have call successors, (88) [2025-03-03 14:31:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 506 transitions. [2025-03-03 14:31:53,474 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 506 transitions. Word has length 40 [2025-03-03 14:31:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:53,474 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 506 transitions. [2025-03-03 14:31:53,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:31:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 506 transitions. [2025-03-03 14:31:53,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 14:31:53,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:53,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:53,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:31:53,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:53,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:53,479 INFO L85 PathProgramCache]: Analyzing trace with hash -913394643, now seen corresponding path program 1 times [2025-03-03 14:31:53,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:53,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744272628] [2025-03-03 14:31:53,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:53,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:53,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 14:31:53,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 14:31:53,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:53,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:31:53,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744272628] [2025-03-03 14:31:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744272628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:53,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:31:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881868213] [2025-03-03 14:31:53,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:53,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:31:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:53,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:31:53,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:31:53,568 INFO L87 Difference]: Start difference. First operand 390 states and 506 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:31:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:53,603 INFO L93 Difference]: Finished difference Result 778 states and 1029 transitions. [2025-03-03 14:31:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:31:53,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-03-03 14:31:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:53,607 INFO L225 Difference]: With dead ends: 778 [2025-03-03 14:31:53,607 INFO L226 Difference]: Without dead ends: 396 [2025-03-03 14:31:53,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:31:53,611 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:53,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:31:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-03 14:31:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-03 14:31:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 297 states have (on average 1.228956228956229) internal successors, (365), 309 states have internal predecessors, (365), 59 states have call successors, (59), 40 states have call predecessors, (59), 39 states have return successors, (88), 58 states have call predecessors, (88), 54 states have call successors, (88) [2025-03-03 14:31:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 512 transitions. [2025-03-03 14:31:53,658 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 512 transitions. Word has length 50 [2025-03-03 14:31:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:53,658 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 512 transitions. [2025-03-03 14:31:53,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:31:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 512 transitions. [2025-03-03 14:31:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:31:53,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:53,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:53,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:31:53,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:53,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash 133531336, now seen corresponding path program 1 times [2025-03-03 14:31:53,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:53,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107634698] [2025-03-03 14:31:53,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:53,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:53,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:31:53,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:31:53,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:53,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:31:53,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107634698] [2025-03-03 14:31:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107634698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:53,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:53,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:31:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896404362] [2025-03-03 14:31:53,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:53,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:31:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:53,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:31:53,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:31:53,712 INFO L87 Difference]: Start difference. First operand 396 states and 512 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 14:31:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:53,728 INFO L93 Difference]: Finished difference Result 624 states and 769 transitions. [2025-03-03 14:31:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:31:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-03 14:31:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:53,730 INFO L225 Difference]: With dead ends: 624 [2025-03-03 14:31:53,730 INFO L226 Difference]: Without dead ends: 329 [2025-03-03 14:31:53,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:31:53,732 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:53,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 184 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:31:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-03 14:31:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-03-03 14:31:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 249 states have (on average 1.2530120481927711) internal successors, (312), 265 states have internal predecessors, (312), 40 states have call successors, (40), 33 states have call predecessors, (40), 39 states have return successors, (52), 42 states have call predecessors, (52), 40 states have call successors, (52) [2025-03-03 14:31:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 404 transitions. [2025-03-03 14:31:53,750 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 404 transitions. Word has length 47 [2025-03-03 14:31:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:53,750 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 404 transitions. [2025-03-03 14:31:53,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 14:31:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 404 transitions. [2025-03-03 14:31:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 14:31:53,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:53,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:53,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:31:53,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:53,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1757866514, now seen corresponding path program 1 times [2025-03-03 14:31:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:53,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958728533] [2025-03-03 14:31:53,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:53,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 14:31:53,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 14:31:53,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:53,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:31:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958728533] [2025-03-03 14:31:53,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958728533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:53,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:53,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:31:53,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388186831] [2025-03-03 14:31:53,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:53,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:31:53,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:53,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:31:53,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:31:53,827 INFO L87 Difference]: Start difference. First operand 329 states and 404 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:31:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:53,860 INFO L93 Difference]: Finished difference Result 654 states and 820 transitions. [2025-03-03 14:31:53,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:31:53,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-03-03 14:31:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:53,862 INFO L225 Difference]: With dead ends: 654 [2025-03-03 14:31:53,862 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 14:31:53,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:31:53,863 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:53,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:31:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 14:31:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-03 14:31:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 253 states have (on average 1.2490118577075098) internal successors, (316), 269 states have internal predecessors, (316), 40 states have call successors, (40), 33 states have call predecessors, (40), 39 states have return successors, (52), 42 states have call predecessors, (52), 40 states have call successors, (52) [2025-03-03 14:31:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 408 transitions. [2025-03-03 14:31:53,885 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 408 transitions. Word has length 50 [2025-03-03 14:31:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:53,886 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 408 transitions. [2025-03-03 14:31:53,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:31:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 408 transitions. [2025-03-03 14:31:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 14:31:53,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:53,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:53,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:31:53,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:53,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1335164688, now seen corresponding path program 1 times [2025-03-03 14:31:53,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:53,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347195519] [2025-03-03 14:31:53,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:53,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 14:31:53,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 14:31:53,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:53,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:31:53,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:53,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347195519] [2025-03-03 14:31:53,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347195519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:53,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:31:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116065705] [2025-03-03 14:31:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:53,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:31:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:53,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:31:53,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:31:53,974 INFO L87 Difference]: Start difference. First operand 333 states and 408 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:31:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:54,080 INFO L93 Difference]: Finished difference Result 1079 states and 1365 transitions. [2025-03-03 14:31:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:31:54,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-03-03 14:31:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:54,084 INFO L225 Difference]: With dead ends: 1079 [2025-03-03 14:31:54,084 INFO L226 Difference]: Without dead ends: 754 [2025-03-03 14:31:54,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:31:54,085 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 132 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:54,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 334 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:31:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-03 14:31:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 740. [2025-03-03 14:31:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 560 states have (on average 1.2285714285714286) internal successors, (688), 592 states have internal predecessors, (688), 92 states have call successors, (92), 77 states have call predecessors, (92), 87 states have return successors, (137), 96 states have call predecessors, (137), 92 states have call successors, (137) [2025-03-03 14:31:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 917 transitions. [2025-03-03 14:31:54,134 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 917 transitions. Word has length 50 [2025-03-03 14:31:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:54,134 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 917 transitions. [2025-03-03 14:31:54,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:31:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 917 transitions. [2025-03-03 14:31:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 14:31:54,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:54,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:54,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:31:54,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:54,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash 361350130, now seen corresponding path program 1 times [2025-03-03 14:31:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:54,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886952026] [2025-03-03 14:31:54,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:54,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:54,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 14:31:54,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 14:31:54,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:54,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:31:54,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:54,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886952026] [2025-03-03 14:31:54,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886952026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:54,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:54,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:31:54,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511515583] [2025-03-03 14:31:54,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:54,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:31:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:54,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:31:54,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:31:54,293 INFO L87 Difference]: Start difference. First operand 740 states and 917 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 14:31:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:54,670 INFO L93 Difference]: Finished difference Result 2003 states and 2564 transitions. [2025-03-03 14:31:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:31:54,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2025-03-03 14:31:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:54,677 INFO L225 Difference]: With dead ends: 2003 [2025-03-03 14:31:54,677 INFO L226 Difference]: Without dead ends: 1405 [2025-03-03 14:31:54,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:31:54,680 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 337 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:54,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 591 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:31:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2025-03-03 14:31:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1269. [2025-03-03 14:31:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 957 states have (on average 1.2163009404388714) internal successors, (1164), 1015 states have internal predecessors, (1164), 156 states have call successors, (156), 134 states have call predecessors, (156), 155 states have return successors, (225), 162 states have call predecessors, (225), 156 states have call successors, (225) [2025-03-03 14:31:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1545 transitions. [2025-03-03 14:31:54,781 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1545 transitions. Word has length 54 [2025-03-03 14:31:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:54,781 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1545 transitions. [2025-03-03 14:31:54,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 14:31:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1545 transitions. [2025-03-03 14:31:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:31:54,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:54,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:54,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:31:54,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:54,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:54,784 INFO L85 PathProgramCache]: Analyzing trace with hash 583414304, now seen corresponding path program 1 times [2025-03-03 14:31:54,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:54,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425939460] [2025-03-03 14:31:54,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:54,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:31:54,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:31:54,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:54,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:31:54,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425939460] [2025-03-03 14:31:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425939460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:31:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731917880] [2025-03-03 14:31:54,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:54,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:31:54,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:31:54,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:31:54,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:31:54,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:31:55,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:31:55,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:55,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:55,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:31:55,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:31:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:31:55,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:31:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:31:55,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731917880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:31:55,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:31:55,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2025-03-03 14:31:55,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083343328] [2025-03-03 14:31:55,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:31:55,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:31:55,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:55,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:31:55,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:31:55,333 INFO L87 Difference]: Start difference. First operand 1269 states and 1545 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 12 states have internal predecessors, (123), 5 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-03 14:31:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:55,770 INFO L93 Difference]: Finished difference Result 2896 states and 3678 transitions. [2025-03-03 14:31:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:31:55,771 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 12 states have internal predecessors, (123), 5 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) Word has length 94 [2025-03-03 14:31:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:55,780 INFO L225 Difference]: With dead ends: 2896 [2025-03-03 14:31:55,781 INFO L226 Difference]: Without dead ends: 1763 [2025-03-03 14:31:55,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 183 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:31:55,785 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 260 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:55,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1940 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:31:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-03-03 14:31:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1480. [2025-03-03 14:31:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1103 states have (on average 1.2184950135992747) internal successors, (1344), 1184 states have internal predecessors, (1344), 190 states have call successors, (190), 168 states have call predecessors, (190), 186 states have return successors, (272), 188 states have call predecessors, (272), 190 states have call successors, (272) [2025-03-03 14:31:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1806 transitions. [2025-03-03 14:31:55,884 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1806 transitions. Word has length 94 [2025-03-03 14:31:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:55,885 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 1806 transitions. [2025-03-03 14:31:55,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 12 states have internal predecessors, (123), 5 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-03 14:31:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1806 transitions. [2025-03-03 14:31:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:31:55,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:55,892 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:31:55,899 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-03 14:31:56,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:31:56,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:56,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1956146866, now seen corresponding path program 1 times [2025-03-03 14:31:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948747800] [2025-03-03 14:31:56,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:56,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:31:56,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:31:56,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:56,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-03 14:31:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948747800] [2025-03-03 14:31:56,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948747800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:31:56,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:31:56,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:31:56,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300412440] [2025-03-03 14:31:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:31:56,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:31:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:56,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:31:56,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:31:56,186 INFO L87 Difference]: Start difference. First operand 1480 states and 1806 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:31:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:56,245 INFO L93 Difference]: Finished difference Result 2842 states and 3489 transitions. [2025-03-03 14:31:56,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:31:56,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 167 [2025-03-03 14:31:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:56,252 INFO L225 Difference]: With dead ends: 2842 [2025-03-03 14:31:56,253 INFO L226 Difference]: Without dead ends: 1498 [2025-03-03 14:31:56,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:31:56,256 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:56,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:31:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-03 14:31:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1498. [2025-03-03 14:31:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1121 states have (on average 1.2149866190900982) internal successors, (1362), 1202 states have internal predecessors, (1362), 190 states have call successors, (190), 168 states have call predecessors, (190), 186 states have return successors, (272), 188 states have call predecessors, (272), 190 states have call successors, (272) [2025-03-03 14:31:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1824 transitions. [2025-03-03 14:31:56,342 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1824 transitions. Word has length 167 [2025-03-03 14:31:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:56,343 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1824 transitions. [2025-03-03 14:31:56,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:31:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1824 transitions. [2025-03-03 14:31:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 14:31:56,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:56,348 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 14:31:56,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:31:56,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:56,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:56,349 INFO L85 PathProgramCache]: Analyzing trace with hash -943630764, now seen corresponding path program 1 times [2025-03-03 14:31:56,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:56,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6610465] [2025-03-03 14:31:56,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:56,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:31:56,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:31:56,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:56,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 84 proven. 31 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 14:31:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:56,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6610465] [2025-03-03 14:31:56,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6610465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:31:56,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604392039] [2025-03-03 14:31:56,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:56,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:31:56,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:31:56,597 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:31:56,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:31:56,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:31:56,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:31:56,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:56,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:56,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:31:56,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:31:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 136 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 14:31:56,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:31:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 74 proven. 43 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 14:31:57,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604392039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:31:57,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:31:57,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2025-03-03 14:31:57,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544655214] [2025-03-03 14:31:57,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:31:57,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:31:57,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:57,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:31:57,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:31:57,252 INFO L87 Difference]: Start difference. First operand 1498 states and 1824 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 22 states have internal predecessors, (203), 10 states have call successors, (29), 6 states have call predecessors, (29), 9 states have return successors, (31), 9 states have call predecessors, (31), 10 states have call successors, (31) [2025-03-03 14:31:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:57,869 INFO L93 Difference]: Finished difference Result 3433 states and 4361 transitions. [2025-03-03 14:31:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:31:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 22 states have internal predecessors, (203), 10 states have call successors, (29), 6 states have call predecessors, (29), 9 states have return successors, (31), 9 states have call predecessors, (31), 10 states have call successors, (31) Word has length 171 [2025-03-03 14:31:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:57,880 INFO L225 Difference]: With dead ends: 3433 [2025-03-03 14:31:57,881 INFO L226 Difference]: Without dead ends: 1943 [2025-03-03 14:31:57,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 330 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:31:57,886 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 463 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:57,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 802 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:31:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-03-03 14:31:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1770. [2025-03-03 14:31:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1330 states have (on average 1.1984962406015038) internal successors, (1594), 1412 states have internal predecessors, (1594), 233 states have call successors, (233), 208 states have call predecessors, (233), 206 states have return successors, (294), 213 states have call predecessors, (294), 233 states have call successors, (294) [2025-03-03 14:31:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2121 transitions. [2025-03-03 14:31:57,991 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2121 transitions. Word has length 171 [2025-03-03 14:31:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:57,992 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2121 transitions. [2025-03-03 14:31:57,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 22 states have internal predecessors, (203), 10 states have call successors, (29), 6 states have call predecessors, (29), 9 states have return successors, (31), 9 states have call predecessors, (31), 10 states have call successors, (31) [2025-03-03 14:31:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2121 transitions. [2025-03-03 14:31:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 14:31:57,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:57,995 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 14:31:58,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:31:58,200 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,SelfDestructingSolverStorable11 [2025-03-03 14:31:58,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:58,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1346036601, now seen corresponding path program 1 times [2025-03-03 14:31:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631506208] [2025-03-03 14:31:58,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:58,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 14:31:58,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:31:58,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:58,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-03 14:31:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:31:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631506208] [2025-03-03 14:31:58,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631506208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:31:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712398064] [2025-03-03 14:31:58,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:58,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:31:58,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:31:58,379 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-03 14:31:58,381 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-03 14:31:58,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 14:31:58,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:31:58,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:58,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:31:58,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:31:58,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:31:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 172 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 14:31:58,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:31:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 94 proven. 55 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-03 14:31:58,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712398064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:31:58,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:31:58,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2025-03-03 14:31:58,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808240775] [2025-03-03 14:31:58,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:31:58,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:31:58,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:31:58,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:31:58,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:31:58,918 INFO L87 Difference]: Start difference. First operand 1770 states and 2121 transitions. Second operand has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 19 states have internal predecessors, (218), 7 states have call successors, (32), 5 states have call predecessors, (32), 13 states have return successors, (34), 11 states have call predecessors, (34), 7 states have call successors, (34) [2025-03-03 14:31:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:31:59,467 INFO L93 Difference]: Finished difference Result 3492 states and 4221 transitions. [2025-03-03 14:31:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:31:59,468 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 19 states have internal predecessors, (218), 7 states have call successors, (32), 5 states have call predecessors, (32), 13 states have return successors, (34), 11 states have call predecessors, (34), 7 states have call successors, (34) Word has length 183 [2025-03-03 14:31:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:31:59,476 INFO L225 Difference]: With dead ends: 3492 [2025-03-03 14:31:59,476 INFO L226 Difference]: Without dead ends: 1858 [2025-03-03 14:31:59,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:31:59,481 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 317 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:31:59,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1050 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:31:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-03-03 14:31:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1746. [2025-03-03 14:31:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1314 states have (on average 1.1887366818873668) internal successors, (1562), 1389 states have internal predecessors, (1562), 218 states have call successors, (218), 210 states have call predecessors, (218), 213 states have return successors, (268), 208 states have call predecessors, (268), 218 states have call successors, (268) [2025-03-03 14:31:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2048 transitions. [2025-03-03 14:31:59,584 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2048 transitions. Word has length 183 [2025-03-03 14:31:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:31:59,585 INFO L471 AbstractCegarLoop]: Abstraction has 1746 states and 2048 transitions. [2025-03-03 14:31:59,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 19 states have internal predecessors, (218), 7 states have call successors, (32), 5 states have call predecessors, (32), 13 states have return successors, (34), 11 states have call predecessors, (34), 7 states have call successors, (34) [2025-03-03 14:31:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2048 transitions. [2025-03-03 14:31:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 14:31:59,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:31:59,588 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 14:31:59,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:31:59,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:31:59,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:31:59,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:31:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -143363005, now seen corresponding path program 1 times [2025-03-03 14:31:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:31:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872365484] [2025-03-03 14:31:59,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:31:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:31:59,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 14:31:59,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 14:31:59,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:31:59,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 88 proven. 39 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:32:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872365484] [2025-03-03 14:32:00,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872365484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967670027] [2025-03-03 14:32:00,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:00,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:00,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:00,185 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-03 14:32:00,187 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-03 14:32:00,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 14:32:00,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 14:32:00,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:00,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:00,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 14:32:00,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 118 proven. 25 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 14:32:00,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 91 proven. 46 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 14:32:00,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967670027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:00,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:00,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 13] total 21 [2025-03-03 14:32:00,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889773622] [2025-03-03 14:32:00,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:00,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 14:32:00,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:00,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 14:32:00,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:32:00,879 INFO L87 Difference]: Start difference. First operand 1746 states and 2048 transitions. Second operand has 21 states, 21 states have (on average 10.19047619047619) internal successors, (214), 20 states have internal predecessors, (214), 13 states have call successors, (36), 8 states have call predecessors, (36), 13 states have return successors, (35), 13 states have call predecessors, (35), 13 states have call successors, (35) [2025-03-03 14:32:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:01,612 INFO L93 Difference]: Finished difference Result 3419 states and 4077 transitions. [2025-03-03 14:32:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 14:32:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.19047619047619) internal successors, (214), 20 states have internal predecessors, (214), 13 states have call successors, (36), 8 states have call predecessors, (36), 13 states have return successors, (35), 13 states have call predecessors, (35), 13 states have call successors, (35) Word has length 184 [2025-03-03 14:32:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:01,621 INFO L225 Difference]: With dead ends: 3419 [2025-03-03 14:32:01,621 INFO L226 Difference]: Without dead ends: 2348 [2025-03-03 14:32:01,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 363 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=420, Invalid=1062, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 14:32:01,625 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 534 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:01,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1070 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:32:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-03-03 14:32:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2122. [2025-03-03 14:32:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 1592 states have (on average 1.1821608040201006) internal successors, (1882), 1682 states have internal predecessors, (1882), 270 states have call successors, (270), 260 states have call predecessors, (270), 259 states have return successors, (331), 254 states have call predecessors, (331), 270 states have call successors, (331) [2025-03-03 14:32:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2483 transitions. [2025-03-03 14:32:01,729 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2483 transitions. Word has length 184 [2025-03-03 14:32:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:01,729 INFO L471 AbstractCegarLoop]: Abstraction has 2122 states and 2483 transitions. [2025-03-03 14:32:01,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.19047619047619) internal successors, (214), 20 states have internal predecessors, (214), 13 states have call successors, (36), 8 states have call predecessors, (36), 13 states have return successors, (35), 13 states have call predecessors, (35), 13 states have call successors, (35) [2025-03-03 14:32:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2483 transitions. [2025-03-03 14:32:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 14:32:01,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:01,734 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:01,756 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-03 14:32:01,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:01,938 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:01,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash -156632814, now seen corresponding path program 1 times [2025-03-03 14:32:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:01,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995939973] [2025-03-03 14:32:01,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:01,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:01,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 14:32:01,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 14:32:01,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:01,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-03 14:32:01,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:01,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995939973] [2025-03-03 14:32:01,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995939973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:32:01,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:32:01,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:32:01,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943658113] [2025-03-03 14:32:01,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:32:01,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:32:01,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:02,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:32:02,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:32:02,000 INFO L87 Difference]: Start difference. First operand 2122 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:32:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:02,043 INFO L93 Difference]: Finished difference Result 2524 states and 2962 transitions. [2025-03-03 14:32:02,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:32:02,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 221 [2025-03-03 14:32:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:02,053 INFO L225 Difference]: With dead ends: 2524 [2025-03-03 14:32:02,053 INFO L226 Difference]: Without dead ends: 874 [2025-03-03 14:32:02,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:32:02,057 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 29 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:02,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 232 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:32:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-03 14:32:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 862. [2025-03-03 14:32:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 646 states have (on average 1.1424148606811146) internal successors, (738), 681 states have internal predecessors, (738), 110 states have call successors, (110), 105 states have call predecessors, (110), 105 states have return successors, (131), 102 states have call predecessors, (131), 110 states have call successors, (131) [2025-03-03 14:32:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 979 transitions. [2025-03-03 14:32:02,096 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 979 transitions. Word has length 221 [2025-03-03 14:32:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:02,096 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 979 transitions. [2025-03-03 14:32:02,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:32:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 979 transitions. [2025-03-03 14:32:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 14:32:02,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:02,099 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:02,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:32:02,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:02,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:02,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1354930936, now seen corresponding path program 1 times [2025-03-03 14:32:02,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:02,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578635467] [2025-03-03 14:32:02,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:02,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 14:32:02,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 14:32:02,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:02,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 153 proven. 62 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-03 14:32:02,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578635467] [2025-03-03 14:32:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578635467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269376830] [2025-03-03 14:32:02,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:02,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:02,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:02,608 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:32:02,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:32:02,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 14:32:02,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 14:32:02,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:02,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:02,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 14:32:02,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 134 proven. 87 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-03 14:32:02,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 87 proven. 136 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-03 14:32:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269376830] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:03,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:03,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 16] total 27 [2025-03-03 14:32:03,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210991528] [2025-03-03 14:32:03,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:03,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:32:03,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:03,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:32:03,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:32:03,567 INFO L87 Difference]: Start difference. First operand 862 states and 979 transitions. Second operand has 27 states, 27 states have (on average 10.037037037037036) internal successors, (271), 26 states have internal predecessors, (271), 14 states have call successors, (47), 8 states have call predecessors, (47), 15 states have return successors, (49), 14 states have call predecessors, (49), 14 states have call successors, (49) [2025-03-03 14:32:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:04,503 INFO L93 Difference]: Finished difference Result 1449 states and 1665 transitions. [2025-03-03 14:32:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 14:32:04,504 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.037037037037036) internal successors, (271), 26 states have internal predecessors, (271), 14 states have call successors, (47), 8 states have call predecessors, (47), 15 states have return successors, (49), 14 states have call predecessors, (49), 14 states have call successors, (49) Word has length 233 [2025-03-03 14:32:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:04,506 INFO L225 Difference]: With dead ends: 1449 [2025-03-03 14:32:04,506 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:32:04,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 456 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=778, Invalid=2528, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 14:32:04,510 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 659 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:04,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1264 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 14:32:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:32:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:32:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:32:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:32:04,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2025-03-03 14:32:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:32:04,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.037037037037036) internal successors, (271), 26 states have internal predecessors, (271), 14 states have call successors, (47), 8 states have call predecessors, (47), 15 states have return successors, (49), 14 states have call predecessors, (49), 14 states have call successors, (49) [2025-03-03 14:32:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:32:04,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:32:04,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:32:04,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:32:04,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:32:04,722 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:04,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:32:11,260 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:32:11,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:32:11 BoogieIcfgContainer [2025-03-03 14:32:11,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:32:11,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:32:11,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:32:11,269 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:32:11,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:31:52" (3/4) ... [2025-03-03 14:32:11,271 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:32:11,275 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-03-03 14:32:11,275 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-03-03 14:32:11,275 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-03-03 14:32:11,275 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-03-03 14:32:11,275 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-03-03 14:32:11,276 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-03-03 14:32:11,276 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-03-03 14:32:11,276 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2025-03-03 14:32:11,279 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-03 14:32:11,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-03 14:32:11,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-03 14:32:11,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:32:11,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:32:11,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:32:11,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:32:11,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:32:11,347 INFO L158 Benchmark]: Toolchain (without parser) took 20030.96ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 104.6MB in the beginning and 488.8MB in the end (delta: -384.2MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2025-03-03 14:32:11,348 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:32:11,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.61ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 85.8MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:32:11,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.08ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:32:11,348 INFO L158 Benchmark]: Boogie Preprocessor took 24.16ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 83.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:32:11,348 INFO L158 Benchmark]: IcfgBuilder took 317.75ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 64.1MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:32:11,349 INFO L158 Benchmark]: TraceAbstraction took 19240.85ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 63.0MB in the beginning and 497.1MB in the end (delta: -434.0MB). Peak memory consumption was 286.5MB. Max. memory is 16.1GB. [2025-03-03 14:32:11,349 INFO L158 Benchmark]: Witness Printer took 78.36ms. Allocated memory is still 545.3MB. Free memory was 497.1MB in the beginning and 488.8MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:32:11,350 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.97ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.61ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 85.8MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.08ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.16ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 83.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.75ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 64.1MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19240.85ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 63.0MB in the beginning and 497.1MB in the end (delta: -434.0MB). Peak memory consumption was 286.5MB. Max. memory is 16.1GB. * Witness Printer took 78.36ms. Allocated memory is still 545.3MB. Free memory was 497.1MB in the beginning and 488.8MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [49] - GenericResultAtLocation [Line: 277]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [277] - GenericResultAtLocation [Line: 381]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [381] - GenericResultAtLocation [Line: 448]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [448] - GenericResultAtLocation [Line: 483]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [483] - GenericResultAtLocation [Line: 849]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [849] - GenericResultAtLocation [Line: 953]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [953] - GenericResultAtLocation [Line: 962]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [962] * 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: 958]: 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, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 16, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3319 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3271 mSDsluCounter, 10347 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8182 mSDsCounter, 939 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5023 IncrementalHoareTripleChecker+Invalid, 5962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 939 mSolverCounterUnsat, 2165 mSDtfsCounter, 5023 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1978 GetRequests, 1723 SyntacticMatches, 26 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1762 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2122occurred in iteration=14, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 1007 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2523 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3362 ConstructedInterpolants, 0 QuantifiedInterpolants, 7674 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 3170/3786 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: 392]: Location Invariant Derived location invariant: ((((((((((switchedOnBeforeTS != 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 0)) && (pumpRunning == 1)) || ((((pumpRunning == 0) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (0 == systemActive))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((waterLevel <= 1) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= switchedOnBeforeTS)) && (pumpRunning == 1))) || ((((2 == waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 289]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-03-03 14:32:11,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE