./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_productSimulator.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62c2cf132c1af8470eae7f9b6621445fd5b91c1643db1f71bf7213022a4dec0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:54:53,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:54:53,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:54:53,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:54:53,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:54:53,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:54:53,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:54:53,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:54:53,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:54:53,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:54:53,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:54:53,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:54:53,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:54:53,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:54:53,418 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:54:53,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:54:53,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:54:53,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:54:53,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:54:53,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:54:53,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:54:53,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:54:53,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:54:53,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:54:53,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:54:53,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:54:53,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:54:53,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:54:53,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:54:53,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:54:53,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:54:53,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:54:53,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:54:53,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:54:53,421 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62c2cf132c1af8470eae7f9b6621445fd5b91c1643db1f71bf7213022a4dec0a [2025-02-05 15:54:53,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:54:53,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:54:53,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:54:53,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:54:53,637 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:54:53,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_productSimulator.cil.c [2025-02-05 15:54:54,812 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0534feb02/ecd5716b34634193a9510914ba95d5ba/FLAG6d7d7a111 [2025-02-05 15:54:55,100 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:54:55,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_productSimulator.cil.c [2025-02-05 15:54:55,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0534feb02/ecd5716b34634193a9510914ba95d5ba/FLAG6d7d7a111 [2025-02-05 15:54:55,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0534feb02/ecd5716b34634193a9510914ba95d5ba [2025-02-05 15:54:55,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:54:55,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:54:55,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:54:55,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:54:55,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:54:55,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8ff166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55, skipping insertion in model container [2025-02-05 15:54:55,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:54:55,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_productSimulator.cil.c[5724,5737] [2025-02-05 15:54:55,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:54:55,793 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:54:55,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2025-02-05 15:54:55,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [168] [2025-02-05 15:54:55,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [272] [2025-02-05 15:54:55,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [317] [2025-02-05 15:54:55,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [326] [2025-02-05 15:54:55,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [692] [2025-02-05 15:54:55,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [771] [2025-02-05 15:54:55,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [1110] [2025-02-05 15:54:55,816 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_productSimulator.cil.c[5724,5737] [2025-02-05 15:54:55,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:54:55,878 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:54:55,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55 WrapperNode [2025-02-05 15:54:55,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:54:55,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:54:55,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:54:55,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:54:55,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,919 INFO L138 Inliner]: procedures = 65, calls = 124, calls flagged for inlining = 30, calls inlined = 27, statements flattened = 300 [2025-02-05 15:54:55,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:54:55,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:54:55,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:54:55,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:54:55,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,950 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-02-05 15:54:55,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:54:55,960 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:54:55,960 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:54:55,960 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:54:55,961 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (1/1) ... [2025-02-05 15:54:55,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:54:55,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:55,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:54:55,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:54:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:54:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump__before__methaneQuery [2025-02-05 15:54:56,002 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump__before__methaneQuery [2025-02-05 15:54:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:54:56,002 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:54:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:54:56,002 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:54:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__before__highWaterSensor [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__before__highWaterSensor [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__before__methaneAlarm [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__before__methaneAlarm [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__before__lowWaterSensor [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__before__lowWaterSensor [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:54:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:54:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:54:56,065 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:54:56,067 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:54:56,111 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010: #res := ~retValue_acc~11; [2025-02-05 15:54:56,167 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L156-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2025-02-05 15:54:56,167 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~12#1; [2025-02-05 15:54:56,175 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: #res := ~retValue_acc~5; [2025-02-05 15:54:56,242 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L142-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1; [2025-02-05 15:54:56,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:54:56,360 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L314-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-02-05 15:54:56,360 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L269-1: main_#res#1 := main_~retValue_acc~4#1; [2025-02-05 15:54:56,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1084-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~13#1; [2025-02-05 15:54:56,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L165-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~3#1; [2025-02-05 15:54:56,397 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~0#1; [2025-02-05 15:54:56,397 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1001: #res#1 := ~retValue_acc~10#1; [2025-02-05 15:54:56,424 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-02-05 15:54:56,424 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:54:56,435 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:54:56,435 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:54:56,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:54:56 BoogieIcfgContainer [2025-02-05 15:54:56,436 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:54:56,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:54:56,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:54:56,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:54:56,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:54:55" (1/3) ... [2025-02-05 15:54:56,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df0c63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:54:56, skipping insertion in model container [2025-02-05 15:54:56,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:55" (2/3) ... [2025-02-05 15:54:56,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df0c63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:54:56, skipping insertion in model container [2025-02-05 15:54:56,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:54:56" (3/3) ... [2025-02-05 15:54:56,445 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec5_productSimulator.cil.c [2025-02-05 15:54:56,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:54:56,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec5_productSimulator.cil.c that has 13 procedures, 147 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:54:56,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:54:56,500 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;@4b5fe3e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:54:56,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:54:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 118 states have internal predecessors, (137), 30 states have call successors, (30), 12 states have call predecessors, (30), 11 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 15:54:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 15:54:56,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:56,510 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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-02-05 15:54:56,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:56,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash -718031457, now seen corresponding path program 1 times [2025-02-05 15:54:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325895642] [2025-02-05 15:54:56,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:56,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 15:54:56,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 15:54:56,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:56,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 15:54:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:56,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325895642] [2025-02-05 15:54:56,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325895642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:56,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:56,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:54:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930149296] [2025-02-05 15:54:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:56,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:54:56,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:56,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:54:56,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:54:56,731 INFO L87 Difference]: Start difference. First operand has 146 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 118 states have internal predecessors, (137), 30 states have call successors, (30), 12 states have call predecessors, (30), 11 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:54:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:56,762 INFO L93 Difference]: Finished difference Result 260 states and 358 transitions. [2025-02-05 15:54:56,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:54:56,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2025-02-05 15:54:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:56,769 INFO L225 Difference]: With dead ends: 260 [2025-02-05 15:54:56,769 INFO L226 Difference]: Without dead ends: 138 [2025-02-05 15:54:56,771 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-02-05 15:54:56,773 INFO L435 NwaCegarLoop]: 190 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, 190 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-02-05 15:54:56,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-05 15:54:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-02-05 15:54:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 96 states have (on average 1.3125) internal successors, (126), 111 states have internal predecessors, (126), 30 states have call successors, (30), 12 states have call predecessors, (30), 11 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 15:54:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 185 transitions. [2025-02-05 15:54:56,802 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 185 transitions. Word has length 62 [2025-02-05 15:54:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:56,803 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 185 transitions. [2025-02-05 15:54:56,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:54:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 185 transitions. [2025-02-05 15:54:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 15:54:56,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:56,807 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:56,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:54:56,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:56,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash -417078603, now seen corresponding path program 1 times [2025-02-05 15:54:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033919826] [2025-02-05 15:54:56,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:56,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 15:54:56,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 15:54:56,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:56,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 15:54:56,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033919826] [2025-02-05 15:54:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033919826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:56,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:56,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:54:56,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641791916] [2025-02-05 15:54:56,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:56,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:54:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:56,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:54:56,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:54:56,939 INFO L87 Difference]: Start difference. First operand 138 states and 185 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:54:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:56,954 INFO L93 Difference]: Finished difference Result 220 states and 295 transitions. [2025-02-05 15:54:56,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:54:56,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2025-02-05 15:54:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:56,956 INFO L225 Difference]: With dead ends: 220 [2025-02-05 15:54:56,956 INFO L226 Difference]: Without dead ends: 129 [2025-02-05 15:54:56,957 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-02-05 15:54:56,959 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 319 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-02-05 15:54:56,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 319 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-05 15:54:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-02-05 15:54:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 105 states have internal predecessors, (119), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (27), 22 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 15:54:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2025-02-05 15:54:56,970 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 63 [2025-02-05 15:54:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:56,971 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2025-02-05 15:54:56,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:54:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2025-02-05 15:54:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 15:54:56,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:56,972 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:56,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:54:56,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:56,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash 906711861, now seen corresponding path program 1 times [2025-02-05 15:54:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997269524] [2025-02-05 15:54:56,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:56,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 15:54:56,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 15:54:56,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:56,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 15:54:57,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:57,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997269524] [2025-02-05 15:54:57,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997269524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:57,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:57,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:54:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974196715] [2025-02-05 15:54:57,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:57,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:54:57,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:57,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:54:57,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:54:57,094 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:54:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:57,126 INFO L93 Difference]: Finished difference Result 339 states and 462 transitions. [2025-02-05 15:54:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:54:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2025-02-05 15:54:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:57,128 INFO L225 Difference]: With dead ends: 339 [2025-02-05 15:54:57,128 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 15:54:57,130 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-02-05 15:54:57,130 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 135 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:57,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 329 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 15:54:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2025-02-05 15:54:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 160 states have (on average 1.35625) internal successors, (217), 189 states have internal predecessors, (217), 48 states have call successors, (48), 21 states have call predecessors, (48), 21 states have return successors, (48), 37 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 15:54:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 313 transitions. [2025-02-05 15:54:57,155 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 313 transitions. Word has length 67 [2025-02-05 15:54:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:57,156 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 313 transitions. [2025-02-05 15:54:57,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:54:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 313 transitions. [2025-02-05 15:54:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 15:54:57,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:57,158 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:57,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:54:57,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:57,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1350856583, now seen corresponding path program 1 times [2025-02-05 15:54:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174771598] [2025-02-05 15:54:57,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:57,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:57,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 15:54:57,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 15:54:57,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:57,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:54:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:57,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174771598] [2025-02-05 15:54:57,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174771598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:57,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:57,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:54:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306935908] [2025-02-05 15:54:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:57,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:54:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:57,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:54:57,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:54:57,279 INFO L87 Difference]: Start difference. First operand 230 states and 313 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:54:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:57,454 INFO L93 Difference]: Finished difference Result 564 states and 798 transitions. [2025-02-05 15:54:57,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:54:57,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-02-05 15:54:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:57,457 INFO L225 Difference]: With dead ends: 564 [2025-02-05 15:54:57,457 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 15:54:57,458 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-02-05 15:54:57,461 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 132 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:57,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 727 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:54:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 15:54:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2025-02-05 15:54:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 254 states have (on average 1.3228346456692914) internal successors, (336), 287 states have internal predecessors, (336), 64 states have call successors, (64), 37 states have call predecessors, (64), 37 states have return successors, (84), 59 states have call predecessors, (84), 64 states have call successors, (84) [2025-02-05 15:54:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 484 transitions. [2025-02-05 15:54:57,503 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 484 transitions. Word has length 71 [2025-02-05 15:54:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:57,504 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 484 transitions. [2025-02-05 15:54:57,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:54:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 484 transitions. [2025-02-05 15:54:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 15:54:57,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:57,508 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:57,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:54:57,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:57,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:57,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1500912424, now seen corresponding path program 1 times [2025-02-05 15:54:57,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:57,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388984025] [2025-02-05 15:54:57,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:57,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 15:54:57,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 15:54:57,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:57,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 15:54:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388984025] [2025-02-05 15:54:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388984025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:57,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:57,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:54:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620538654] [2025-02-05 15:54:57,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:57,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:54:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:57,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:54:57,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:54:57,650 INFO L87 Difference]: Start difference. First operand 356 states and 484 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:54:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:57,684 INFO L93 Difference]: Finished difference Result 695 states and 988 transitions. [2025-02-05 15:54:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:54:57,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2025-02-05 15:54:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:57,689 INFO L225 Difference]: With dead ends: 695 [2025-02-05 15:54:57,690 INFO L226 Difference]: Without dead ends: 362 [2025-02-05 15:54:57,691 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-02-05 15:54:57,692 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 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-02-05 15:54:57,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-05 15:54:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-02-05 15:54:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 260 states have (on average 1.3153846153846154) internal successors, (342), 293 states have internal predecessors, (342), 64 states have call successors, (64), 37 states have call predecessors, (64), 37 states have return successors, (84), 59 states have call predecessors, (84), 64 states have call successors, (84) [2025-02-05 15:54:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 490 transitions. [2025-02-05 15:54:57,723 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 490 transitions. Word has length 91 [2025-02-05 15:54:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:57,724 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 490 transitions. [2025-02-05 15:54:57,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:54:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 490 transitions. [2025-02-05 15:54:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 15:54:57,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:57,726 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:57,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:54:57,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:57,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash -539298407, now seen corresponding path program 1 times [2025-02-05 15:54:57,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:57,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224712658] [2025-02-05 15:54:57,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:57,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 15:54:57,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 15:54:57,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:57,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 15:54:57,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:57,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224712658] [2025-02-05 15:54:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224712658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:57,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:57,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:54:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823591359] [2025-02-05 15:54:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:54:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:57,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:54:57,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:54:57,817 INFO L87 Difference]: Start difference. First operand 362 states and 490 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:54:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:57,848 INFO L93 Difference]: Finished difference Result 705 states and 998 transitions. [2025-02-05 15:54:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:54:57,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2025-02-05 15:54:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:57,850 INFO L225 Difference]: With dead ends: 705 [2025-02-05 15:54:57,850 INFO L226 Difference]: Without dead ends: 366 [2025-02-05 15:54:57,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:54:57,856 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:57,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 507 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-02-05 15:54:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-02-05 15:54:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 264 states have (on average 1.3106060606060606) internal successors, (346), 297 states have internal predecessors, (346), 64 states have call successors, (64), 37 states have call predecessors, (64), 37 states have return successors, (84), 59 states have call predecessors, (84), 64 states have call successors, (84) [2025-02-05 15:54:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 494 transitions. [2025-02-05 15:54:57,887 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 494 transitions. Word has length 91 [2025-02-05 15:54:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:57,888 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 494 transitions. [2025-02-05 15:54:57,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:54:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 494 transitions. [2025-02-05 15:54:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 15:54:57,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:57,889 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:57,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:54:57,890 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:57,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash 846904987, now seen corresponding path program 1 times [2025-02-05 15:54:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:57,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350244292] [2025-02-05 15:54:57,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:57,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:57,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 15:54:57,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 15:54:57,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:57,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 15:54:57,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:57,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350244292] [2025-02-05 15:54:57,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350244292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:57,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:57,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:54:57,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389170914] [2025-02-05 15:54:57,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:57,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:54:57,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:57,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:54:57,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:54:57,984 INFO L87 Difference]: Start difference. First operand 366 states and 494 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 15:54:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:58,150 INFO L93 Difference]: Finished difference Result 1138 states and 1603 transitions. [2025-02-05 15:54:58,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:54:58,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 91 [2025-02-05 15:54:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:58,158 INFO L225 Difference]: With dead ends: 1138 [2025-02-05 15:54:58,158 INFO L226 Difference]: Without dead ends: 795 [2025-02-05 15:54:58,159 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-02-05 15:54:58,160 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 211 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:58,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 512 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:54:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-05 15:54:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 783. [2025-02-05 15:54:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 567 states have (on average 1.3051146384479717) internal successors, (740), 634 states have internal predecessors, (740), 134 states have call successors, (134), 79 states have call predecessors, (134), 81 states have return successors, (212), 126 states have call predecessors, (212), 134 states have call successors, (212) [2025-02-05 15:54:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1086 transitions. [2025-02-05 15:54:58,213 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1086 transitions. Word has length 91 [2025-02-05 15:54:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:58,214 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1086 transitions. [2025-02-05 15:54:58,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 15:54:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1086 transitions. [2025-02-05 15:54:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 15:54:58,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:58,218 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:58,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:54:58,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:58,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash -847530919, now seen corresponding path program 1 times [2025-02-05 15:54:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702021123] [2025-02-05 15:54:58,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:58,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:58,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 15:54:58,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 15:54:58,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:58,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 15:54:58,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:58,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702021123] [2025-02-05 15:54:58,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702021123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:58,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:58,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:54:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365215756] [2025-02-05 15:54:58,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:58,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:54:58,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:58,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:54:58,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:54:58,435 INFO L87 Difference]: Start difference. First operand 783 states and 1086 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:54:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:59,113 INFO L93 Difference]: Finished difference Result 2292 states and 3266 transitions. [2025-02-05 15:54:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:54:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 95 [2025-02-05 15:54:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:59,126 INFO L225 Difference]: With dead ends: 2292 [2025-02-05 15:54:59,127 INFO L226 Difference]: Without dead ends: 1662 [2025-02-05 15:54:59,131 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-02-05 15:54:59,132 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 500 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:59,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 848 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:54:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2025-02-05 15:54:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1644. [2025-02-05 15:54:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1198 states have (on average 1.2796327212020033) internal successors, (1533), 1327 states have internal predecessors, (1533), 262 states have call successors, (262), 159 states have call predecessors, (262), 183 states have return successors, (446), 277 states have call predecessors, (446), 262 states have call successors, (446) [2025-02-05 15:54:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2241 transitions. [2025-02-05 15:54:59,258 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2241 transitions. Word has length 95 [2025-02-05 15:54:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:59,258 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2241 transitions. [2025-02-05 15:54:59,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:54:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2241 transitions. [2025-02-05 15:54:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:54:59,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:59,261 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:54:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:54:59,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:59,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1484028069, now seen corresponding path program 1 times [2025-02-05 15:54:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:59,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269792153] [2025-02-05 15:54:59,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:59,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:54:59,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:54:59,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:59,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 15:54:59,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269792153] [2025-02-05 15:54:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269792153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:54:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342632395] [2025-02-05 15:54:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:59,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:54:59,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:59,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:54:59,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:54:59,326 INFO L87 Difference]: Start difference. First operand 1644 states and 2241 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:54:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:59,485 INFO L93 Difference]: Finished difference Result 2697 states and 3656 transitions. [2025-02-05 15:54:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:54:59,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-02-05 15:54:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:59,492 INFO L225 Difference]: With dead ends: 2697 [2025-02-05 15:54:59,492 INFO L226 Difference]: Without dead ends: 1076 [2025-02-05 15:54:59,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:54:59,497 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 206 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:59,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 369 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:54:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-02-05 15:54:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1064. [2025-02-05 15:54:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 786 states have (on average 1.2684478371501273) internal successors, (997), 863 states have internal predecessors, (997), 161 states have call successors, (161), 103 states have call predecessors, (161), 116 states have return successors, (254), 170 states have call predecessors, (254), 161 states have call successors, (254) [2025-02-05 15:54:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1412 transitions. [2025-02-05 15:54:59,588 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1412 transitions. Word has length 125 [2025-02-05 15:54:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1412 transitions. [2025-02-05 15:54:59,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:54:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1412 transitions. [2025-02-05 15:54:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:54:59,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:59,591 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:54:59,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:54:59,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:59,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 321185273, now seen corresponding path program 1 times [2025-02-05 15:54:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:59,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035804101] [2025-02-05 15:54:59,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:59,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:59,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:54:59,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:54:59,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:59,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-05 15:54:59,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:59,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035804101] [2025-02-05 15:54:59,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035804101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:54:59,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288624088] [2025-02-05 15:54:59,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:59,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:59,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:59,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:54:59,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:54:59,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:54:59,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:54:59,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:59,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:59,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:54:59,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:54:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 15:54:59,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:54:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288624088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:59,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:54:59,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-02-05 15:54:59,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282978902] [2025-02-05 15:54:59,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:59,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:54:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:59,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:54:59,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:54:59,817 INFO L87 Difference]: Start difference. First operand 1064 states and 1412 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, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:54:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:59,900 INFO L93 Difference]: Finished difference Result 2266 states and 3072 transitions. [2025-02-05 15:54:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:54:59,901 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, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2025-02-05 15:54:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:59,910 INFO L225 Difference]: With dead ends: 2266 [2025-02-05 15:54:59,910 INFO L226 Difference]: Without dead ends: 1225 [2025-02-05 15:54:59,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 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-02-05 15:54:59,913 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 92 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:59,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 347 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-02-05 15:54:59,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1127. [2025-02-05 15:54:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 838 states have (on average 1.2553699284009547) internal successors, (1052), 912 states have internal predecessors, (1052), 164 states have call successors, (164), 110 states have call predecessors, (164), 124 states have return successors, (258), 171 states have call predecessors, (258), 164 states have call successors, (258) [2025-02-05 15:54:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1474 transitions. [2025-02-05 15:54:59,983 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1474 transitions. Word has length 134 [2025-02-05 15:54:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:59,983 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1474 transitions. [2025-02-05 15:54:59,984 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, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:54:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1474 transitions. [2025-02-05 15:54:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:54:59,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:59,986 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:54:59,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:00,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:55:00,193 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:00,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash -80573479, now seen corresponding path program 1 times [2025-02-05 15:55:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022702230] [2025-02-05 15:55:00,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:00,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:55:00,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:55:00,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:00,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 15:55:00,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022702230] [2025-02-05 15:55:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022702230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661256667] [2025-02-05 15:55:00,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:00,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:00,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:00,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:00,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:55:00,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:55:00,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:55:00,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:00,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:00,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:55:00,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 15:55:00,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 15:55:00,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661256667] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:00,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:00,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2025-02-05 15:55:00,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959821756] [2025-02-05 15:55:00,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:00,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 15:55:00,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:00,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 15:55:00,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:55:00,885 INFO L87 Difference]: Start difference. First operand 1127 states and 1474 transitions. Second operand has 15 states, 15 states have (on average 10.6) internal successors, (159), 13 states have internal predecessors, (159), 7 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (36), 10 states have call predecessors, (36), 7 states have call successors, (36) [2025-02-05 15:55:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:01,575 INFO L93 Difference]: Finished difference Result 2311 states and 3085 transitions. [2025-02-05 15:55:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 15:55:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.6) internal successors, (159), 13 states have internal predecessors, (159), 7 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (36), 10 states have call predecessors, (36), 7 states have call successors, (36) Word has length 136 [2025-02-05 15:55:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:01,583 INFO L225 Difference]: With dead ends: 2311 [2025-02-05 15:55:01,583 INFO L226 Difference]: Without dead ends: 1492 [2025-02-05 15:55:01,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 269 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 15:55:01,588 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 440 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:01,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 2383 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:55:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-02-05 15:55:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1323. [2025-02-05 15:55:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 978 states have (on average 1.247443762781186) internal successors, (1220), 1069 states have internal predecessors, (1220), 191 states have call successors, (191), 140 states have call predecessors, (191), 153 states have return successors, (265), 193 states have call predecessors, (265), 191 states have call successors, (265) [2025-02-05 15:55:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1676 transitions. [2025-02-05 15:55:01,658 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1676 transitions. Word has length 136 [2025-02-05 15:55:01,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:01,658 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1676 transitions. [2025-02-05 15:55:01,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.6) internal successors, (159), 13 states have internal predecessors, (159), 7 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (36), 10 states have call predecessors, (36), 7 states have call successors, (36) [2025-02-05 15:55:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1676 transitions. [2025-02-05 15:55:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 15:55:01,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:01,663 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:01,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:01,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:01,865 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:01,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash -384901164, now seen corresponding path program 1 times [2025-02-05 15:55:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049152499] [2025-02-05 15:55:01,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:01,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 15:55:01,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 15:55:01,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:01,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-05 15:55:01,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:01,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049152499] [2025-02-05 15:55:01,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049152499] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:01,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501987447] [2025-02-05 15:55:01,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:01,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:01,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:02,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:02,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:55:02,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 15:55:02,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 15:55:02,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:02,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:02,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:55:02,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 15:55:02,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:55:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501987447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:02,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:55:02,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-02-05 15:55:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955865042] [2025-02-05 15:55:02,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:02,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:55:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:02,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:55:02,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:55:02,279 INFO L87 Difference]: Start difference. First operand 1323 states and 1676 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:55:02,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:02,372 INFO L93 Difference]: Finished difference Result 3856 states and 4948 transitions. [2025-02-05 15:55:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:55:02,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 229 [2025-02-05 15:55:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:02,386 INFO L225 Difference]: With dead ends: 3856 [2025-02-05 15:55:02,387 INFO L226 Difference]: Without dead ends: 2556 [2025-02-05 15:55:02,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 230 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-02-05 15:55:02,392 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 91 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:02,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 377 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-02-05 15:55:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2554. [2025-02-05 15:55:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 1900 states have (on average 1.2478947368421052) internal successors, (2371), 2058 states have internal predecessors, (2371), 350 states have call successors, (350), 277 states have call predecessors, (350), 303 states have return successors, (522), 345 states have call predecessors, (522), 350 states have call successors, (522) [2025-02-05 15:55:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3243 transitions. [2025-02-05 15:55:02,565 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3243 transitions. Word has length 229 [2025-02-05 15:55:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:02,566 INFO L471 AbstractCegarLoop]: Abstraction has 2554 states and 3243 transitions. [2025-02-05 15:55:02,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:55:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3243 transitions. [2025-02-05 15:55:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-05 15:55:02,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:02,580 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:55:02,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:02,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:02,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:02,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:02,782 INFO L85 PathProgramCache]: Analyzing trace with hash -660430706, now seen corresponding path program 1 times [2025-02-05 15:55:02,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:02,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874748858] [2025-02-05 15:55:02,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:02,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:02,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-05 15:55:02,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-05 15:55:02,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:02,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 87 proven. 16 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-02-05 15:55:02,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:02,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874748858] [2025-02-05 15:55:02,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874748858] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:02,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631647007] [2025-02-05 15:55:02,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:02,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:02,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:02,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:02,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:55:02,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-05 15:55:03,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-05 15:55:03,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:03,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:03,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:55:03,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:55:03,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:55:03,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631647007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:03,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:55:03,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-02-05 15:55:03,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391693491] [2025-02-05 15:55:03,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:03,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:55:03,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:03,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:55:03,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:55:03,148 INFO L87 Difference]: Start difference. First operand 2554 states and 3243 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-05 15:55:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:03,280 INFO L93 Difference]: Finished difference Result 3926 states and 4966 transitions. [2025-02-05 15:55:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:55:03,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 242 [2025-02-05 15:55:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:03,293 INFO L225 Difference]: With dead ends: 3926 [2025-02-05 15:55:03,293 INFO L226 Difference]: Without dead ends: 2686 [2025-02-05 15:55:03,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 243 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-02-05 15:55:03,297 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 76 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:03,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 456 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-02-05 15:55:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2684. [2025-02-05 15:55:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2684 states, 2001 states have (on average 1.2453773113443278) internal successors, (2492), 2164 states have internal predecessors, (2492), 366 states have call successors, (366), 292 states have call predecessors, (366), 316 states have return successors, (500), 358 states have call predecessors, (500), 366 states have call successors, (500) [2025-02-05 15:55:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3358 transitions. [2025-02-05 15:55:03,464 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3358 transitions. Word has length 242 [2025-02-05 15:55:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:03,465 INFO L471 AbstractCegarLoop]: Abstraction has 2684 states and 3358 transitions. [2025-02-05 15:55:03,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-05 15:55:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3358 transitions. [2025-02-05 15:55:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 15:55:03,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:03,473 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:03,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:55:03,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:55:03,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:03,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 362561143, now seen corresponding path program 1 times [2025-02-05 15:55:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051745057] [2025-02-05 15:55:03,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:03,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 15:55:03,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 15:55:03,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:03,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 90 proven. 24 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-05 15:55:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051745057] [2025-02-05 15:55:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051745057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074150349] [2025-02-05 15:55:03,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:03,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:03,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:03,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:03,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:55:03,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 15:55:03,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 15:55:03,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:03,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:03,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:55:03,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 15:55:03,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:55:03,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074150349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:03,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:55:03,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-02-05 15:55:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346048592] [2025-02-05 15:55:03,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:03,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:55:03,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:03,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:55:03,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:55:03,968 INFO L87 Difference]: Start difference. First operand 2684 states and 3358 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:55:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:04,169 INFO L93 Difference]: Finished difference Result 7501 states and 9541 transitions. [2025-02-05 15:55:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:55:04,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 227 [2025-02-05 15:55:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:04,193 INFO L225 Difference]: With dead ends: 7501 [2025-02-05 15:55:04,193 INFO L226 Difference]: Without dead ends: 4973 [2025-02-05 15:55:04,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 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-02-05 15:55:04,202 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 84 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:04,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 390 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2025-02-05 15:55:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4961. [2025-02-05 15:55:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4961 states, 3712 states have (on average 1.2411099137931034) internal successors, (4607), 3976 states have internal predecessors, (4607), 649 states have call successors, (649), 556 states have call predecessors, (649), 599 states have return successors, (972), 625 states have call predecessors, (972), 649 states have call successors, (972) [2025-02-05 15:55:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4961 states to 4961 states and 6228 transitions. [2025-02-05 15:55:04,536 INFO L78 Accepts]: Start accepts. Automaton has 4961 states and 6228 transitions. Word has length 227 [2025-02-05 15:55:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:04,537 INFO L471 AbstractCegarLoop]: Abstraction has 4961 states and 6228 transitions. [2025-02-05 15:55:04,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:55:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4961 states and 6228 transitions. [2025-02-05 15:55:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-02-05 15:55:04,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:04,551 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:04,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:04,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 15:55:04,755 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:04,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:04,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1559707272, now seen corresponding path program 1 times [2025-02-05 15:55:04,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:04,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022021585] [2025-02-05 15:55:04,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:04,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:04,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-05 15:55:04,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-05 15:55:04,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:04,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-05 15:55:04,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:04,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022021585] [2025-02-05 15:55:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022021585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544766604] [2025-02-05 15:55:04,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:04,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:04,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:04,882 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:04,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:55:04,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-05 15:55:05,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-05 15:55:05,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:05,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:05,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:55:05,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-05 15:55:05,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:55:05,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544766604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:55:05,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:55:05,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:55:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857888227] [2025-02-05 15:55:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:55:05,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:55:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:05,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:55:05,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:55:05,138 INFO L87 Difference]: Start difference. First operand 4961 states and 6228 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-05 15:55:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:05,311 INFO L93 Difference]: Finished difference Result 7269 states and 9070 transitions. [2025-02-05 15:55:05,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:55:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 240 [2025-02-05 15:55:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:05,333 INFO L225 Difference]: With dead ends: 7269 [2025-02-05 15:55:05,333 INFO L226 Difference]: Without dead ends: 4973 [2025-02-05 15:55:05,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 240 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-02-05 15:55:05,342 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 67 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:05,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 454 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:55:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2025-02-05 15:55:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4825. [2025-02-05 15:55:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 3610 states have (on average 1.2371191135734072) internal successors, (4466), 3866 states have internal predecessors, (4466), 635 states have call successors, (635), 545 states have call predecessors, (635), 579 states have return successors, (853), 604 states have call predecessors, (853), 635 states have call successors, (853) [2025-02-05 15:55:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 5954 transitions. [2025-02-05 15:55:05,583 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 5954 transitions. Word has length 240 [2025-02-05 15:55:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:05,585 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 5954 transitions. [2025-02-05 15:55:05,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-05 15:55:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 5954 transitions. [2025-02-05 15:55:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-05 15:55:05,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:05,598 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 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, 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, 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-02-05 15:55:05,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:05,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:55:05,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:05,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash 887937078, now seen corresponding path program 1 times [2025-02-05 15:55:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128069517] [2025-02-05 15:55:05,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:05,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:05,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-05 15:55:05,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-05 15:55:05,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:05,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 8 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-02-05 15:55:06,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128069517] [2025-02-05 15:55:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128069517] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105664450] [2025-02-05 15:55:06,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:06,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:06,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:06,013 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:06,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:55:06,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-05 15:55:06,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-05 15:55:06,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:06,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:06,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:55:06,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 163 proven. 3 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-02-05 15:55:06,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 42 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-02-05 15:55:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105664450] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:06,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:06,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 23 [2025-02-05 15:55:06,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409444321] [2025-02-05 15:55:06,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:06,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 15:55:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:06,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 15:55:06,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:55:06,807 INFO L87 Difference]: Start difference. First operand 4825 states and 5954 transitions. Second operand has 23 states, 23 states have (on average 10.652173913043478) internal successors, (245), 21 states have internal predecessors, (245), 10 states have call successors, (54), 6 states have call predecessors, (54), 12 states have return successors, (58), 11 states have call predecessors, (58), 10 states have call successors, (58) [2025-02-05 15:55:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:09,219 INFO L93 Difference]: Finished difference Result 15759 states and 20094 transitions. [2025-02-05 15:55:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-05 15:55:09,220 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.652173913043478) internal successors, (245), 21 states have internal predecessors, (245), 10 states have call successors, (54), 6 states have call predecessors, (54), 12 states have return successors, (58), 11 states have call predecessors, (58), 10 states have call successors, (58) Word has length 238 [2025-02-05 15:55:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:09,268 INFO L225 Difference]: With dead ends: 15759 [2025-02-05 15:55:09,269 INFO L226 Difference]: Without dead ends: 10711 [2025-02-05 15:55:09,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 472 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=702, Invalid=2958, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 15:55:09,287 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1486 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 783 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 783 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:09,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1397 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [783 Valid, 2639 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 15:55:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10711 states. [2025-02-05 15:55:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10711 to 10431. [2025-02-05 15:55:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10431 states, 7853 states have (on average 1.195339360753852) internal successors, (9387), 8341 states have internal predecessors, (9387), 1384 states have call successors, (1384), 1209 states have call predecessors, (1384), 1193 states have return successors, (1743), 1244 states have call predecessors, (1743), 1384 states have call successors, (1743) [2025-02-05 15:55:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10431 states to 10431 states and 12514 transitions. [2025-02-05 15:55:09,877 INFO L78 Accepts]: Start accepts. Automaton has 10431 states and 12514 transitions. Word has length 238 [2025-02-05 15:55:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:09,877 INFO L471 AbstractCegarLoop]: Abstraction has 10431 states and 12514 transitions. [2025-02-05 15:55:09,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.652173913043478) internal successors, (245), 21 states have internal predecessors, (245), 10 states have call successors, (54), 6 states have call predecessors, (54), 12 states have return successors, (58), 11 states have call predecessors, (58), 10 states have call successors, (58) [2025-02-05 15:55:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 10431 states and 12514 transitions. [2025-02-05 15:55:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-05 15:55:09,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:09,903 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 15:55:09,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:10,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:10,104 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:10,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash -653282152, now seen corresponding path program 1 times [2025-02-05 15:55:10,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:10,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594614452] [2025-02-05 15:55:10,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:10,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:10,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 15:55:10,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 15:55:10,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:10,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 93 proven. 93 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 15:55:10,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:10,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594614452] [2025-02-05 15:55:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594614452] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:10,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676733849] [2025-02-05 15:55:10,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:10,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:10,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:10,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:10,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:55:10,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 15:55:10,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 15:55:10,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:10,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:10,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:55:10,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 211 proven. 13 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-02-05 15:55:10,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 104 proven. 80 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-02-05 15:55:11,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676733849] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:11,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:11,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2025-02-05 15:55:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067078271] [2025-02-05 15:55:11,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:11,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 15:55:11,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:11,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 15:55:11,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:55:11,085 INFO L87 Difference]: Start difference. First operand 10431 states and 12514 transitions. Second operand has 23 states, 23 states have (on average 12.608695652173912) internal successors, (290), 20 states have internal predecessors, (290), 9 states have call successors, (54), 5 states have call predecessors, (54), 14 states have return successors, (59), 13 states have call predecessors, (59), 9 states have call successors, (59) [2025-02-05 15:55:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:12,576 INFO L93 Difference]: Finished difference Result 19056 states and 22781 transitions. [2025-02-05 15:55:12,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 15:55:12,577 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 12.608695652173912) internal successors, (290), 20 states have internal predecessors, (290), 9 states have call successors, (54), 5 states have call predecessors, (54), 14 states have return successors, (59), 13 states have call predecessors, (59), 9 states have call successors, (59) Word has length 254 [2025-02-05 15:55:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:12,616 INFO L225 Difference]: With dead ends: 19056 [2025-02-05 15:55:12,617 INFO L226 Difference]: Without dead ends: 11099 [2025-02-05 15:55:12,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=371, Invalid=1435, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 15:55:12,635 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 673 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:12,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1490 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 15:55:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11099 states. [2025-02-05 15:55:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11099 to 10167. [2025-02-05 15:55:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10167 states, 7666 states have (on average 1.187972867205844) internal successors, (9107), 8114 states have internal predecessors, (9107), 1276 states have call successors, (1276), 1201 states have call predecessors, (1276), 1224 states have return successors, (1635), 1201 states have call predecessors, (1635), 1276 states have call successors, (1635) [2025-02-05 15:55:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10167 states to 10167 states and 12018 transitions. [2025-02-05 15:55:13,213 INFO L78 Accepts]: Start accepts. Automaton has 10167 states and 12018 transitions. Word has length 254 [2025-02-05 15:55:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:13,213 INFO L471 AbstractCegarLoop]: Abstraction has 10167 states and 12018 transitions. [2025-02-05 15:55:13,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.608695652173912) internal successors, (290), 20 states have internal predecessors, (290), 9 states have call successors, (54), 5 states have call predecessors, (54), 14 states have return successors, (59), 13 states have call predecessors, (59), 9 states have call successors, (59) [2025-02-05 15:55:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 10167 states and 12018 transitions. [2025-02-05 15:55:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 15:55:13,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:13,231 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 15:55:13,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 15:55:13,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 15:55:13,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:13,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:13,433 INFO L85 PathProgramCache]: Analyzing trace with hash 295884366, now seen corresponding path program 1 times [2025-02-05 15:55:13,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:13,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618923231] [2025-02-05 15:55:13,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:13,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:13,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 15:55:13,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 15:55:13,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:13,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-02-05 15:55:13,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:13,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618923231] [2025-02-05 15:55:13,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618923231] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:13,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325020160] [2025-02-05 15:55:13,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:13,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:13,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:13,510 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:13,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:55:13,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 15:55:13,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 15:55:13,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:13,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:13,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:55:13,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 147 proven. 27 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-05 15:55:13,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 110 proven. 44 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-05 15:55:14,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325020160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:14,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:14,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 13] total 19 [2025-02-05 15:55:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457729657] [2025-02-05 15:55:14,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:14,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 15:55:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:14,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 15:55:14,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:55:14,175 INFO L87 Difference]: Start difference. First operand 10167 states and 12018 transitions. Second operand has 19 states, 19 states have (on average 13.526315789473685) internal successors, (257), 18 states have internal predecessors, (257), 12 states have call successors, (62), 7 states have call predecessors, (62), 12 states have return successors, (65), 12 states have call predecessors, (65), 12 states have call successors, (65) [2025-02-05 15:55:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:15,514 INFO L93 Difference]: Finished difference Result 20490 states and 24614 transitions. [2025-02-05 15:55:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 15:55:15,514 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.526315789473685) internal successors, (257), 18 states have internal predecessors, (257), 12 states have call successors, (62), 7 states have call predecessors, (62), 12 states have return successors, (65), 12 states have call predecessors, (65), 12 states have call successors, (65) Word has length 255 [2025-02-05 15:55:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:15,555 INFO L225 Difference]: With dead ends: 20490 [2025-02-05 15:55:15,556 INFO L226 Difference]: Without dead ends: 14218 [2025-02-05 15:55:15,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 496 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=317, Invalid=805, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 15:55:15,573 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 952 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:15,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1457 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:55:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2025-02-05 15:55:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 12510. [2025-02-05 15:55:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12510 states, 9466 states have (on average 1.1858229452778364) internal successors, (11225), 9970 states have internal predecessors, (11225), 1577 states have call successors, (1577), 1486 states have call predecessors, (1577), 1466 states have return successors, (1907), 1477 states have call predecessors, (1907), 1577 states have call successors, (1907) [2025-02-05 15:55:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12510 states to 12510 states and 14709 transitions. [2025-02-05 15:55:16,489 INFO L78 Accepts]: Start accepts. Automaton has 12510 states and 14709 transitions. Word has length 255 [2025-02-05 15:55:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:16,489 INFO L471 AbstractCegarLoop]: Abstraction has 12510 states and 14709 transitions. [2025-02-05 15:55:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.526315789473685) internal successors, (257), 18 states have internal predecessors, (257), 12 states have call successors, (62), 7 states have call predecessors, (62), 12 states have return successors, (65), 12 states have call predecessors, (65), 12 states have call successors, (65) [2025-02-05 15:55:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 12510 states and 14709 transitions. [2025-02-05 15:55:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-02-05 15:55:16,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:55:16,507 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:16,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 15:55:16,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 15:55:16,708 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:55:16,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:55:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash -208116294, now seen corresponding path program 1 times [2025-02-05 15:55:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:55:16,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094878338] [2025-02-05 15:55:16,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:55:16,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-05 15:55:16,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-05 15:55:16,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:16,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 109 proven. 61 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2025-02-05 15:55:16,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:55:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094878338] [2025-02-05 15:55:16,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094878338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:55:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713698896] [2025-02-05 15:55:16,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:55:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:16,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:55:16,958 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:55:16,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:55:17,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-05 15:55:17,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-05 15:55:17,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:55:17,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:55:17,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 15:55:17,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:55:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 230 proven. 17 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-05 15:55:17,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:55:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 137 proven. 76 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-02-05 15:55:17,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713698896] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:55:17,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:55:17,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 29 [2025-02-05 15:55:17,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845100345] [2025-02-05 15:55:17,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:55:17,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 15:55:17,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:55:17,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 15:55:17,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2025-02-05 15:55:17,829 INFO L87 Difference]: Start difference. First operand 12510 states and 14709 transitions. Second operand has 29 states, 29 states have (on average 9.655172413793103) internal successors, (280), 27 states have internal predecessors, (280), 13 states have call successors, (62), 8 states have call predecessors, (62), 16 states have return successors, (69), 13 states have call predecessors, (69), 13 states have call successors, (69) [2025-02-05 15:55:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:55:19,586 INFO L93 Difference]: Finished difference Result 21714 states and 25949 transitions. [2025-02-05 15:55:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 15:55:19,587 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.655172413793103) internal successors, (280), 27 states have internal predecessors, (280), 13 states have call successors, (62), 8 states have call predecessors, (62), 16 states have return successors, (69), 13 states have call predecessors, (69), 13 states have call successors, (69) Word has length 280 [2025-02-05 15:55:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:55:19,600 INFO L225 Difference]: With dead ends: 21714 [2025-02-05 15:55:19,600 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:55:19,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 545 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=591, Invalid=2061, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 15:55:19,627 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1215 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 3023 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 3675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 3023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:55:19,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 1977 Invalid, 3675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 3023 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 15:55:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:55:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:55:19,628 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-02-05 15:55:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:55:19,638 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 280 [2025-02-05 15:55:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:55:19,639 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:55:19,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.655172413793103) internal successors, (280), 27 states have internal predecessors, (280), 13 states have call successors, (62), 8 states have call predecessors, (62), 16 states have return successors, (69), 13 states have call predecessors, (69), 13 states have call successors, (69) [2025-02-05 15:55:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:55:19,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:55:19,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:55:19,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 15:55:19,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:55:19,844 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:55:19,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:55:35,235 WARN L286 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 829 DAG size of output: 587 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-05 15:56:01,663 WARN L286 SmtUtils]: Spent 13.15s on a formula simplification. DAG size of input: 1884 DAG size of output: 58 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-02-05 15:56:09,974 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 1406 DAG size of output: 39 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-02-05 15:56:17,379 WARN L286 SmtUtils]: Spent 7.35s on a formula simplification. DAG size of input: 1320 DAG size of output: 39 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)