./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash dcf39230c24eb915e747e88202e73a35b6e85db9fcbfa83adc9e68e89fc807d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:57:01,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:57:01,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:57:01,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:57:01,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:57:01,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:57:01,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:57:01,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:57:01,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:57:01,525 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:57:01,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:57:01,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:57:01,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:57:01,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:57:01,526 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:57:01,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:57:01,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:57:01,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:57:01,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:57:01,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:57:01,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:57:01,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:57:01,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:57:01,527 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:57:01,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:57:01,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:57:01,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:57:01,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:57:01,528 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dcf39230c24eb915e747e88202e73a35b6e85db9fcbfa83adc9e68e89fc807d5 [2025-02-07 22:57:01,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:57:01,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:57:01,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:57:01,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:57:01,797 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:57:01,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2025-02-07 22:57:03,002 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b114e09a/ed0cb68afd84434b95bb75c34ab18613/FLAGa1758b540 [2025-02-07 22:57:03,248 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:57:03,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2025-02-07 22:57:03,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b114e09a/ed0cb68afd84434b95bb75c34ab18613/FLAGa1758b540 [2025-02-07 22:57:03,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b114e09a/ed0cb68afd84434b95bb75c34ab18613 [2025-02-07 22:57:03,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:57:03,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:57:03,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:57:03,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:57:03,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:57:03,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:03,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398c1f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03, skipping insertion in model container [2025-02-07 22:57:03,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:03,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:57:03,703 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c[1279,1292] [2025-02-07 22:57:03,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:57:03,821 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:57:03,828 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c[1279,1292] [2025-02-07 22:57:03,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:57:03,922 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:57:03,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03 WrapperNode [2025-02-07 22:57:03,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:57:03,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:57:03,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:57:03,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:57:03,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:03,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,056 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2025-02-07 22:57:04,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:57:04,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:57:04,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:57:04,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:57:04,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,134 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-07 22:57:04,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:57:04,229 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:57:04,230 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:57:04,230 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:57:04,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (1/1) ... [2025-02-07 22:57:04,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:57:04,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:04,283 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-07 22:57:04,288 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-07 22:57:04,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:57:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 22:57:04,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 22:57:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:57:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:57:04,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:57:04,457 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:57:04,458 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:57:05,704 INFO L? ?]: Removed 752 outVars from TransFormulas that were not future-live. [2025-02-07 22:57:05,705 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:57:05,765 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:57:05,766 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:57:05,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:57:05 BoogieIcfgContainer [2025-02-07 22:57:05,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:57:05,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:57:05,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:57:05,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:57:05,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:57:03" (1/3) ... [2025-02-07 22:57:05,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ad27f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:57:05, skipping insertion in model container [2025-02-07 22:57:05,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:57:03" (2/3) ... [2025-02-07 22:57:05,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ad27f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:57:05, skipping insertion in model container [2025-02-07 22:57:05,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:57:05" (3/3) ... [2025-02-07 22:57:05,773 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2025-02-07 22:57:05,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:57:05,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c that has 2 procedures, 390 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:57:05,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:57:05,836 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;@369e0229, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:57:05,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:57:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 384 states have (on average 1.4947916666666667) internal successors, (574), 385 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-07 22:57:05,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:05,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:05,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:05,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash 329665021, now seen corresponding path program 1 times [2025-02-07 22:57:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:05,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8185488] [2025-02-07 22:57:05,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:05,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 22:57:06,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 22:57:06,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:06,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 22:57:06,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:06,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8185488] [2025-02-07 22:57:06,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8185488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178319713] [2025-02-07 22:57:06,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:06,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:06,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:06,243 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-07 22:57:06,244 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-07 22:57:06,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 22:57:06,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 22:57:06,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:06,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:06,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 22:57:06,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 22:57:06,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:57:06,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178319713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:06,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:57:06,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 22:57:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076914688] [2025-02-07 22:57:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:06,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 22:57:06,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:06,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 22:57:06,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 22:57:06,591 INFO L87 Difference]: Start difference. First operand has 390 states, 384 states have (on average 1.4947916666666667) internal successors, (574), 385 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:57:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:06,716 INFO L93 Difference]: Finished difference Result 709 states and 1059 transitions. [2025-02-07 22:57:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 22:57:06,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2025-02-07 22:57:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:06,724 INFO L225 Difference]: With dead ends: 709 [2025-02-07 22:57:06,724 INFO L226 Difference]: Without dead ends: 388 [2025-02-07 22:57:06,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-07 22:57:06,729 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:06,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:57:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-07 22:57:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-02-07 22:57:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 383 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 576 transitions. [2025-02-07 22:57:06,787 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 576 transitions. Word has length 116 [2025-02-07 22:57:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:06,788 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 576 transitions. [2025-02-07 22:57:06,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:57:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 576 transitions. [2025-02-07 22:57:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-07 22:57:06,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:06,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:06,802 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-07 22:57:06,995 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,SelfDestructingSolverStorable0 [2025-02-07 22:57:06,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:06,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash -598367334, now seen corresponding path program 1 times [2025-02-07 22:57:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974111398] [2025-02-07 22:57:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:07,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 22:57:07,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 22:57:07,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:07,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974111398] [2025-02-07 22:57:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974111398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:07,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:07,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:07,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962521252] [2025-02-07 22:57:07,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:07,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:07,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:07,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:07,864 INFO L87 Difference]: Start difference. First operand 388 states and 576 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:08,061 INFO L93 Difference]: Finished difference Result 392 states and 580 transitions. [2025-02-07 22:57:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:08,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116 [2025-02-07 22:57:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:08,064 INFO L225 Difference]: With dead ends: 392 [2025-02-07 22:57:08,066 INFO L226 Difference]: Without dead ends: 390 [2025-02-07 22:57:08,067 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-07 22:57:08,067 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:08,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-07 22:57:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-02-07 22:57:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2025-02-07 22:57:08,088 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 116 [2025-02-07 22:57:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:08,089 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2025-02-07 22:57:08,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2025-02-07 22:57:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-07 22:57:08,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:08,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:08,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:57:08,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:08,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1364838705, now seen corresponding path program 1 times [2025-02-07 22:57:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:08,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691984369] [2025-02-07 22:57:08,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:08,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:08,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-07 22:57:08,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-07 22:57:08,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:08,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:08,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:08,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691984369] [2025-02-07 22:57:08,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691984369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:08,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923679872] [2025-02-07 22:57:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:08,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:08,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:08,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:08,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:08,447 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:08,921 INFO L93 Difference]: Finished difference Result 970 states and 1440 transitions. [2025-02-07 22:57:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:08,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2025-02-07 22:57:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:08,923 INFO L225 Difference]: With dead ends: 970 [2025-02-07 22:57:08,923 INFO L226 Difference]: Without dead ends: 390 [2025-02-07 22:57:08,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:57:08,924 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1090 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:08,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1412 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:57:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-07 22:57:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-02-07 22:57:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.483116883116883) internal successors, (571), 385 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 577 transitions. [2025-02-07 22:57:08,932 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 577 transitions. Word has length 117 [2025-02-07 22:57:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:08,933 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 577 transitions. [2025-02-07 22:57:08,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 577 transitions. [2025-02-07 22:57:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-07 22:57:08,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:08,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:08,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:57:08,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1499737672, now seen corresponding path program 1 times [2025-02-07 22:57:08,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:08,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848020136] [2025-02-07 22:57:08,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:08,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 22:57:08,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 22:57:08,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:08,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:09,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:09,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848020136] [2025-02-07 22:57:09,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848020136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:09,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:09,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:09,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626808720] [2025-02-07 22:57:09,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:09,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:09,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:09,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:09,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:09,190 INFO L87 Difference]: Start difference. First operand 390 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:09,344 INFO L93 Difference]: Finished difference Result 713 states and 1054 transitions. [2025-02-07 22:57:09,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2025-02-07 22:57:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:09,346 INFO L225 Difference]: With dead ends: 713 [2025-02-07 22:57:09,347 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:09,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:09,347 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 0 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:09,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1432 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:57:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2025-02-07 22:57:09,355 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 118 [2025-02-07 22:57:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:09,355 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2025-02-07 22:57:09,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2025-02-07 22:57:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-07 22:57:09,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:09,359 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:09,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:57:09,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1178737116, now seen corresponding path program 1 times [2025-02-07 22:57:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170342566] [2025-02-07 22:57:09,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:09,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-07 22:57:09,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-07 22:57:09,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:09,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:09,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:09,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170342566] [2025-02-07 22:57:09,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170342566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:09,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:09,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125733770] [2025-02-07 22:57:09,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:09,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:09,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:09,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:09,751 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:09,908 INFO L93 Difference]: Finished difference Result 715 states and 1055 transitions. [2025-02-07 22:57:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2025-02-07 22:57:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:09,910 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:09,912 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:09,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:09,913 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 487 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:09,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 929 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:57:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.475452196382429) internal successors, (571), 387 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions. [2025-02-07 22:57:09,924 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 119 [2025-02-07 22:57:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:09,925 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 577 transitions. [2025-02-07 22:57:09,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions. [2025-02-07 22:57:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-07 22:57:09,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:09,928 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:09,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:57:09,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:09,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1756688063, now seen corresponding path program 1 times [2025-02-07 22:57:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:09,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95820949] [2025-02-07 22:57:09,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:09,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-07 22:57:09,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-07 22:57:09,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:09,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:10,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95820949] [2025-02-07 22:57:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95820949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:10,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:10,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938764211] [2025-02-07 22:57:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:10,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:10,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:10,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:10,200 INFO L87 Difference]: Start difference. First operand 392 states and 577 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:10,359 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2025-02-07 22:57:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:10,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2025-02-07 22:57:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:10,362 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:10,363 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:10,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:10,364 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1041 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:10,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 929 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:57:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4728682170542635) internal successors, (570), 387 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions. [2025-02-07 22:57:10,379 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 121 [2025-02-07 22:57:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:10,380 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 576 transitions. [2025-02-07 22:57:10,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 576 transitions. [2025-02-07 22:57:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-07 22:57:10,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:10,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:10,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:57:10,385 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:10,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1781573896, now seen corresponding path program 1 times [2025-02-07 22:57:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:10,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081010167] [2025-02-07 22:57:10,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:10,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-07 22:57:10,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-07 22:57:10,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:10,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:10,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081010167] [2025-02-07 22:57:10,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081010167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:10,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:10,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:10,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686495343] [2025-02-07 22:57:10,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:10,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:10,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:10,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:10,761 INFO L87 Difference]: Start difference. First operand 392 states and 576 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:10,954 INFO L93 Difference]: Finished difference Result 715 states and 1049 transitions. [2025-02-07 22:57:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:10,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2025-02-07 22:57:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:10,956 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:10,956 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:10,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:10,957 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 478 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:10,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 891 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:10,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 387 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2025-02-07 22:57:10,970 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 122 [2025-02-07 22:57:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:10,970 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2025-02-07 22:57:10,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2025-02-07 22:57:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-07 22:57:10,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:10,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:10,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:57:10,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:10,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash -214850246, now seen corresponding path program 1 times [2025-02-07 22:57:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:10,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369321459] [2025-02-07 22:57:10,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:10,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:10,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-07 22:57:11,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-07 22:57:11,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:11,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:11,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369321459] [2025-02-07 22:57:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369321459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:11,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645612050] [2025-02-07 22:57:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:11,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:11,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:11,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:11,219 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:11,457 INFO L93 Difference]: Finished difference Result 715 states and 1047 transitions. [2025-02-07 22:57:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:11,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2025-02-07 22:57:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:11,459 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:11,459 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:11,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:11,461 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 1032 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:11,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 891 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4677002583979328) internal successors, (568), 387 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2025-02-07 22:57:11,469 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 123 [2025-02-07 22:57:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:11,469 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2025-02-07 22:57:11,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2025-02-07 22:57:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-07 22:57:11,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:11,470 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:11,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:57:11,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:11,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1928804195, now seen corresponding path program 1 times [2025-02-07 22:57:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:11,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544342506] [2025-02-07 22:57:11,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:11,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:11,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-07 22:57:11,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-07 22:57:11,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:11,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:11,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544342506] [2025-02-07 22:57:11,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544342506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:11,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:11,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:11,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045947934] [2025-02-07 22:57:11,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:11,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:11,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:11,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:11,682 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:11,863 INFO L93 Difference]: Finished difference Result 715 states and 1045 transitions. [2025-02-07 22:57:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2025-02-07 22:57:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:11,865 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:11,865 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:11,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:11,866 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 1024 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:11,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 891 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:11,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4651162790697674) internal successors, (567), 387 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2025-02-07 22:57:11,874 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 124 [2025-02-07 22:57:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:11,874 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2025-02-07 22:57:11,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2025-02-07 22:57:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-07 22:57:11,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:11,875 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:57:11,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:11,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash -279691979, now seen corresponding path program 1 times [2025-02-07 22:57:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881622481] [2025-02-07 22:57:11,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:11,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-07 22:57:11,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-07 22:57:11,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:11,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:12,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881622481] [2025-02-07 22:57:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881622481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:12,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643212464] [2025-02-07 22:57:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:12,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:12,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:12,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:12,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:12,128 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:12,331 INFO L93 Difference]: Finished difference Result 715 states and 1043 transitions. [2025-02-07 22:57:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:12,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2025-02-07 22:57:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:12,333 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:12,333 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:12,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:12,334 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 552 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:12,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 897 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4625322997416021) internal successors, (566), 387 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2025-02-07 22:57:12,344 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 572 transitions. Word has length 125 [2025-02-07 22:57:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:12,344 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 572 transitions. [2025-02-07 22:57:12,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 572 transitions. [2025-02-07 22:57:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-07 22:57:12,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:12,347 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:12,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:57:12,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:12,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash 807747390, now seen corresponding path program 1 times [2025-02-07 22:57:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613049261] [2025-02-07 22:57:12,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:12,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-07 22:57:12,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-07 22:57:12,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:12,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:12,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613049261] [2025-02-07 22:57:12,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613049261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:12,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548776786] [2025-02-07 22:57:12,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:12,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:12,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:12,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:12,615 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:57:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:12,803 INFO L93 Difference]: Finished difference Result 715 states and 1041 transitions. [2025-02-07 22:57:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:12,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 126 [2025-02-07 22:57:12,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:12,805 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:12,805 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:12,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:12,806 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 518 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:12,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 925 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 387 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 571 transitions. [2025-02-07 22:57:12,814 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 571 transitions. Word has length 126 [2025-02-07 22:57:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:12,814 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 571 transitions. [2025-02-07 22:57:12,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:57:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 571 transitions. [2025-02-07 22:57:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-07 22:57:12,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:12,815 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:12,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:57:12,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:12,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1719590931, now seen corresponding path program 1 times [2025-02-07 22:57:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:12,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970364166] [2025-02-07 22:57:12,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:12,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:12,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-07 22:57:12,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-07 22:57:12,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:12,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970364166] [2025-02-07 22:57:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970364166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:13,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46998654] [2025-02-07 22:57:13,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:13,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:13,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:13,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:13,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:13,071 INFO L87 Difference]: Start difference. First operand 392 states and 571 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:57:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:13,241 INFO L93 Difference]: Finished difference Result 715 states and 1039 transitions. [2025-02-07 22:57:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:13,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2025-02-07 22:57:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:13,243 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:13,243 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:13,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:13,244 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 516 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:13,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 925 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:57:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4573643410852712) internal successors, (564), 387 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 570 transitions. [2025-02-07 22:57:13,252 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 570 transitions. Word has length 127 [2025-02-07 22:57:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:13,252 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 570 transitions. [2025-02-07 22:57:13,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:57:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 570 transitions. [2025-02-07 22:57:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-07 22:57:13,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:13,254 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:13,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:57:13,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:13,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1660999615, now seen corresponding path program 1 times [2025-02-07 22:57:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:13,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489656496] [2025-02-07 22:57:13,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:13,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:13,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-07 22:57:13,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-07 22:57:13,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:13,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489656496] [2025-02-07 22:57:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489656496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:13,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556282716] [2025-02-07 22:57:13,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:13,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:13,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:13,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:13,541 INFO L87 Difference]: Start difference. First operand 392 states and 570 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:13,799 INFO L93 Difference]: Finished difference Result 717 states and 1039 transitions. [2025-02-07 22:57:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:13,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2025-02-07 22:57:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:13,801 INFO L225 Difference]: With dead ends: 717 [2025-02-07 22:57:13,801 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:13,802 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-07 22:57:13,802 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:13,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1286 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.454780361757106) internal successors, (563), 387 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 569 transitions. [2025-02-07 22:57:13,811 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 569 transitions. Word has length 128 [2025-02-07 22:57:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:13,812 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 569 transitions. [2025-02-07 22:57:13,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 569 transitions. [2025-02-07 22:57:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-07 22:57:13,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:13,813 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:13,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:57:13,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:13,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash 972662121, now seen corresponding path program 1 times [2025-02-07 22:57:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757493198] [2025-02-07 22:57:13,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:13,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-07 22:57:13,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-07 22:57:13,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:13,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:14,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:14,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757493198] [2025-02-07 22:57:14,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757493198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:14,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:14,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703561248] [2025-02-07 22:57:14,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:14,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:14,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:14,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:14,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:14,173 INFO L87 Difference]: Start difference. First operand 392 states and 569 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:14,445 INFO L93 Difference]: Finished difference Result 715 states and 1035 transitions. [2025-02-07 22:57:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:14,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129 [2025-02-07 22:57:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:14,447 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:14,447 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:14,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:14,448 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 468 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:14,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1322 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4521963824289406) internal successors, (562), 387 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2025-02-07 22:57:14,457 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 129 [2025-02-07 22:57:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:14,457 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2025-02-07 22:57:14,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2025-02-07 22:57:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-07 22:57:14,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:14,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:14,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:57:14,459 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:14,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1038141905, now seen corresponding path program 1 times [2025-02-07 22:57:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662911765] [2025-02-07 22:57:14,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:14,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-07 22:57:14,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-07 22:57:14,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:14,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:14,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:14,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662911765] [2025-02-07 22:57:14,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662911765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:14,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:14,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183663427] [2025-02-07 22:57:14,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:14,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:14,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:14,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:14,797 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:15,056 INFO L93 Difference]: Finished difference Result 715 states and 1033 transitions. [2025-02-07 22:57:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2025-02-07 22:57:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:15,058 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:15,058 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:15,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:15,059 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 926 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:15,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 885 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.449612403100775) internal successors, (561), 387 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 567 transitions. [2025-02-07 22:57:15,070 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 567 transitions. Word has length 130 [2025-02-07 22:57:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:15,070 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 567 transitions. [2025-02-07 22:57:15,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 567 transitions. [2025-02-07 22:57:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-07 22:57:15,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:15,071 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:15,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:57:15,072 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:15,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1829828771, now seen corresponding path program 1 times [2025-02-07 22:57:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248601319] [2025-02-07 22:57:15,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:15,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-07 22:57:15,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-07 22:57:15,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:15,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248601319] [2025-02-07 22:57:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248601319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:15,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:15,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280788423] [2025-02-07 22:57:15,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:15,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:15,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:15,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:15,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:15,388 INFO L87 Difference]: Start difference. First operand 392 states and 567 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:15,597 INFO L93 Difference]: Finished difference Result 715 states and 1031 transitions. [2025-02-07 22:57:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:15,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2025-02-07 22:57:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:15,599 INFO L225 Difference]: With dead ends: 715 [2025-02-07 22:57:15,599 INFO L226 Difference]: Without dead ends: 392 [2025-02-07 22:57:15,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:15,600 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 920 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:15,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 885 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-07 22:57:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-07 22:57:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4470284237726099) internal successors, (560), 387 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 566 transitions. [2025-02-07 22:57:15,609 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 566 transitions. Word has length 131 [2025-02-07 22:57:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:15,609 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 566 transitions. [2025-02-07 22:57:15,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 566 transitions. [2025-02-07 22:57:15,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-07 22:57:15,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:15,610 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:15,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:57:15,610 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:15,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash 801528005, now seen corresponding path program 1 times [2025-02-07 22:57:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:15,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134121108] [2025-02-07 22:57:15,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:15,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-07 22:57:15,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-07 22:57:15,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:16,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:16,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134121108] [2025-02-07 22:57:16,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134121108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:16,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:16,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:16,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534775536] [2025-02-07 22:57:16,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:16,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:16,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:16,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:16,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:16,068 INFO L87 Difference]: Start difference. First operand 392 states and 566 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:16,289 INFO L93 Difference]: Finished difference Result 759 states and 1083 transitions. [2025-02-07 22:57:16,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:57:16,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2025-02-07 22:57:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:16,292 INFO L225 Difference]: With dead ends: 759 [2025-02-07 22:57:16,292 INFO L226 Difference]: Without dead ends: 436 [2025-02-07 22:57:16,293 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-07 22:57:16,293 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 18 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:16,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1848 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-07 22:57:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-02-07 22:57:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 1.421911421911422) internal successors, (610), 429 states have internal predecessors, (610), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:57:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 616 transitions. [2025-02-07 22:57:16,305 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 616 transitions. Word has length 132 [2025-02-07 22:57:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:16,305 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 616 transitions. [2025-02-07 22:57:16,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 616 transitions. [2025-02-07 22:57:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-07 22:57:16,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:16,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:16,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:57:16,307 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:16,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 965927204, now seen corresponding path program 1 times [2025-02-07 22:57:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:16,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408173463] [2025-02-07 22:57:16,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:16,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-07 22:57:16,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-07 22:57:16,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:16,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:57:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408173463] [2025-02-07 22:57:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408173463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:16,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:16,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:57:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393716609] [2025-02-07 22:57:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:16,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:16,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:16,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:16,824 INFO L87 Difference]: Start difference. First operand 434 states and 616 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:17,095 INFO L93 Difference]: Finished difference Result 961 states and 1345 transitions. [2025-02-07 22:57:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2025-02-07 22:57:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:17,097 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:17,097 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:17,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:57:17,098 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 831 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:17,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1816 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3928571428571428) internal successors, (819), 588 states have internal predecessors, (819), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 831 transitions. [2025-02-07 22:57:17,127 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 831 transitions. Word has length 133 [2025-02-07 22:57:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:17,127 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 831 transitions. [2025-02-07 22:57:17,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 831 transitions. [2025-02-07 22:57:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-02-07 22:57:17,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:17,130 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:17,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:57:17,131 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:17,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:17,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1802322026, now seen corresponding path program 1 times [2025-02-07 22:57:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:17,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838114496] [2025-02-07 22:57:17,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:17,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:17,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-02-07 22:57:17,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-02-07 22:57:17,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:17,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838114496] [2025-02-07 22:57:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838114496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895694516] [2025-02-07 22:57:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:17,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:17,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:17,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:17,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:17,604 INFO L87 Difference]: Start difference. First operand 596 states and 831 transitions. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:17,804 INFO L93 Difference]: Finished difference Result 961 states and 1344 transitions. [2025-02-07 22:57:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:17,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 321 [2025-02-07 22:57:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:17,807 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:17,807 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:17,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:17,809 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 937 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:17,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 885 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3911564625850341) internal successors, (818), 588 states have internal predecessors, (818), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 830 transitions. [2025-02-07 22:57:17,827 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 830 transitions. Word has length 321 [2025-02-07 22:57:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:17,827 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 830 transitions. [2025-02-07 22:57:17,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 830 transitions. [2025-02-07 22:57:17,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-02-07 22:57:17,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:17,831 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:17,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:57:17,832 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:17,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1404820520, now seen corresponding path program 1 times [2025-02-07 22:57:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:17,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576131032] [2025-02-07 22:57:17,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:17,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:17,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-07 22:57:18,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-07 22:57:18,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:18,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:18,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576131032] [2025-02-07 22:57:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576131032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:18,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134738754] [2025-02-07 22:57:18,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:18,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:18,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:18,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:18,295 INFO L87 Difference]: Start difference. First operand 596 states and 830 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:18,502 INFO L93 Difference]: Finished difference Result 961 states and 1342 transitions. [2025-02-07 22:57:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 322 [2025-02-07 22:57:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:18,505 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:18,505 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:18,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:18,506 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 921 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:18,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 885 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3894557823129252) internal successors, (817), 588 states have internal predecessors, (817), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 829 transitions. [2025-02-07 22:57:18,524 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 829 transitions. Word has length 322 [2025-02-07 22:57:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:18,524 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 829 transitions. [2025-02-07 22:57:18,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 829 transitions. [2025-02-07 22:57:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-02-07 22:57:18,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:18,527 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:18,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:57:18,528 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:18,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2031266073, now seen corresponding path program 1 times [2025-02-07 22:57:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568981254] [2025-02-07 22:57:18,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:18,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-02-07 22:57:18,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-02-07 22:57:18,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:18,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568981254] [2025-02-07 22:57:18,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568981254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:18,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:18,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:18,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216440227] [2025-02-07 22:57:18,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:18,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:18,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:18,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:18,959 INFO L87 Difference]: Start difference. First operand 596 states and 829 transitions. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:19,162 INFO L93 Difference]: Finished difference Result 961 states and 1340 transitions. [2025-02-07 22:57:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:19,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2025-02-07 22:57:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:19,164 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:19,165 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:19,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:19,166 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 905 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:19,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 885 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3877551020408163) internal successors, (816), 588 states have internal predecessors, (816), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 828 transitions. [2025-02-07 22:57:19,180 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 828 transitions. Word has length 323 [2025-02-07 22:57:19,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:19,181 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 828 transitions. [2025-02-07 22:57:19,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 828 transitions. [2025-02-07 22:57:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-02-07 22:57:19,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:19,184 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:19,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:57:19,184 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:19,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 701209049, now seen corresponding path program 1 times [2025-02-07 22:57:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642032581] [2025-02-07 22:57:19,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:19,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-02-07 22:57:19,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-02-07 22:57:19,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:19,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642032581] [2025-02-07 22:57:19,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642032581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:19,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:19,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:19,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120351234] [2025-02-07 22:57:19,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:19,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:19,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:19,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:19,596 INFO L87 Difference]: Start difference. First operand 596 states and 828 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:19,772 INFO L93 Difference]: Finished difference Result 961 states and 1338 transitions. [2025-02-07 22:57:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:19,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2025-02-07 22:57:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:19,775 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:19,775 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:19,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:19,777 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 889 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:19,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 885 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3860544217687074) internal successors, (815), 588 states have internal predecessors, (815), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 827 transitions. [2025-02-07 22:57:19,797 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 827 transitions. Word has length 324 [2025-02-07 22:57:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:19,797 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 827 transitions. [2025-02-07 22:57:19,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 827 transitions. [2025-02-07 22:57:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-07 22:57:19,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:19,801 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:19,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:57:19,801 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:19,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:19,801 INFO L85 PathProgramCache]: Analyzing trace with hash -989393992, now seen corresponding path program 1 times [2025-02-07 22:57:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735644561] [2025-02-07 22:57:19,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:19,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-07 22:57:19,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-07 22:57:19,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:19,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:20,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:20,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735644561] [2025-02-07 22:57:20,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735644561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:20,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:20,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:20,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285639036] [2025-02-07 22:57:20,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:20,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:20,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:20,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:20,245 INFO L87 Difference]: Start difference. First operand 596 states and 827 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:20,404 INFO L93 Difference]: Finished difference Result 961 states and 1336 transitions. [2025-02-07 22:57:20,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:20,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2025-02-07 22:57:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:20,406 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:20,407 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:20,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:20,408 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 866 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:20,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 901 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:57:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3843537414965987) internal successors, (814), 588 states have internal predecessors, (814), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 826 transitions. [2025-02-07 22:57:20,420 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 826 transitions. Word has length 325 [2025-02-07 22:57:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:20,420 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 826 transitions. [2025-02-07 22:57:20,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 826 transitions. [2025-02-07 22:57:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-07 22:57:20,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:20,424 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:20,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 22:57:20,424 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:20,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:20,425 INFO L85 PathProgramCache]: Analyzing trace with hash 112176394, now seen corresponding path program 1 times [2025-02-07 22:57:20,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:20,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890189724] [2025-02-07 22:57:20,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:20,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:20,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-07 22:57:20,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-07 22:57:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:20,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:20,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890189724] [2025-02-07 22:57:20,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890189724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:20,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:20,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9895458] [2025-02-07 22:57:20,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:20,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:20,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:20,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:20,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:20,877 INFO L87 Difference]: Start difference. First operand 596 states and 826 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:21,037 INFO L93 Difference]: Finished difference Result 961 states and 1334 transitions. [2025-02-07 22:57:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:21,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2025-02-07 22:57:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:21,040 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:21,040 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:21,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:21,041 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 850 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:21,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 901 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:57:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3826530612244898) internal successors, (813), 588 states have internal predecessors, (813), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 825 transitions. [2025-02-07 22:57:21,053 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 825 transitions. Word has length 326 [2025-02-07 22:57:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:21,054 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 825 transitions. [2025-02-07 22:57:21,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 825 transitions. [2025-02-07 22:57:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-07 22:57:21,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:21,057 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:21,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 22:57:21,057 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:21,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1431641609, now seen corresponding path program 1 times [2025-02-07 22:57:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:21,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142049008] [2025-02-07 22:57:21,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:21,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-07 22:57:21,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-07 22:57:21,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:21,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:21,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142049008] [2025-02-07 22:57:21,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142049008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:21,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:21,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289969772] [2025-02-07 22:57:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:21,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:21,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:21,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:21,645 INFO L87 Difference]: Start difference. First operand 596 states and 825 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:21,946 INFO L93 Difference]: Finished difference Result 961 states and 1332 transitions. [2025-02-07 22:57:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2025-02-07 22:57:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:21,948 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:21,949 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:21,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:21,950 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 453 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:21,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 681 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:57:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.380952380952381) internal successors, (812), 588 states have internal predecessors, (812), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 824 transitions. [2025-02-07 22:57:21,965 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 824 transitions. Word has length 327 [2025-02-07 22:57:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:21,965 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 824 transitions. [2025-02-07 22:57:21,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 824 transitions. [2025-02-07 22:57:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-07 22:57:21,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:21,969 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:21,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 22:57:21,969 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:21,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2115545669, now seen corresponding path program 1 times [2025-02-07 22:57:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:21,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738720789] [2025-02-07 22:57:21,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:21,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:22,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-07 22:57:22,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-07 22:57:22,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:22,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:22,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:22,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738720789] [2025-02-07 22:57:22,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738720789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347336674] [2025-02-07 22:57:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:22,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:22,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:22,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:22,699 INFO L87 Difference]: Start difference. First operand 596 states and 824 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:22,845 INFO L93 Difference]: Finished difference Result 961 states and 1330 transitions. [2025-02-07 22:57:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2025-02-07 22:57:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:22,848 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:22,848 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:22,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:22,849 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 382 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:22,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 899 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:57:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.379251700680272) internal successors, (811), 588 states have internal predecessors, (811), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 823 transitions. [2025-02-07 22:57:22,863 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 823 transitions. Word has length 328 [2025-02-07 22:57:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:22,863 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 823 transitions. [2025-02-07 22:57:22,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 823 transitions. [2025-02-07 22:57:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-07 22:57:22,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:22,865 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:22,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 22:57:22,866 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:22,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash -545579365, now seen corresponding path program 1 times [2025-02-07 22:57:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:22,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501883795] [2025-02-07 22:57:22,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:22,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-07 22:57:23,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-07 22:57:23,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:23,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:23,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:23,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501883795] [2025-02-07 22:57:23,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501883795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:23,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:23,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081823027] [2025-02-07 22:57:23,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:23,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:23,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:23,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:23,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:23,518 INFO L87 Difference]: Start difference. First operand 596 states and 823 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:23,719 INFO L93 Difference]: Finished difference Result 961 states and 1328 transitions. [2025-02-07 22:57:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:23,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2025-02-07 22:57:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:23,721 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:23,721 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:23,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:23,722 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 455 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:23,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 883 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3775510204081634) internal successors, (810), 588 states have internal predecessors, (810), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 822 transitions. [2025-02-07 22:57:23,737 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 822 transitions. Word has length 329 [2025-02-07 22:57:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:23,737 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 822 transitions. [2025-02-07 22:57:23,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 822 transitions. [2025-02-07 22:57:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-02-07 22:57:23,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:23,739 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:23,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 22:57:23,739 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:23,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash -604916684, now seen corresponding path program 1 times [2025-02-07 22:57:23,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:23,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510336668] [2025-02-07 22:57:23,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:23,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:23,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-02-07 22:57:24,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-02-07 22:57:24,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:24,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:24,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:24,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510336668] [2025-02-07 22:57:24,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510336668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:24,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:24,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:24,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641347517] [2025-02-07 22:57:24,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:24,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:24,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:24,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:24,372 INFO L87 Difference]: Start difference. First operand 596 states and 822 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:24,582 INFO L93 Difference]: Finished difference Result 961 states and 1326 transitions. [2025-02-07 22:57:24,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2025-02-07 22:57:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:24,584 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:24,585 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:24,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:24,586 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 853 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:24,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 877 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3758503401360545) internal successors, (809), 588 states have internal predecessors, (809), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 821 transitions. [2025-02-07 22:57:24,605 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 821 transitions. Word has length 330 [2025-02-07 22:57:24,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:24,605 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 821 transitions. [2025-02-07 22:57:24,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 821 transitions. [2025-02-07 22:57:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-07 22:57:24,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:24,607 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:24,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 22:57:24,607 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:24,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2015607887, now seen corresponding path program 1 times [2025-02-07 22:57:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895009636] [2025-02-07 22:57:24,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:24,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-07 22:57:24,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-07 22:57:24,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:24,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:25,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:25,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895009636] [2025-02-07 22:57:25,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895009636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:25,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:25,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598671937] [2025-02-07 22:57:25,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:25,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:25,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:25,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:25,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:25,312 INFO L87 Difference]: Start difference. First operand 596 states and 821 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:25,498 INFO L93 Difference]: Finished difference Result 961 states and 1324 transitions. [2025-02-07 22:57:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:25,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2025-02-07 22:57:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:25,501 INFO L225 Difference]: With dead ends: 961 [2025-02-07 22:57:25,501 INFO L226 Difference]: Without dead ends: 596 [2025-02-07 22:57:25,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:25,502 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 391 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:25,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 877 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-07 22:57:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-07 22:57:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3741496598639455) internal successors, (808), 588 states have internal predecessors, (808), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 22:57:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 820 transitions. [2025-02-07 22:57:25,512 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 820 transitions. Word has length 331 [2025-02-07 22:57:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:25,513 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 820 transitions. [2025-02-07 22:57:25,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 820 transitions. [2025-02-07 22:57:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-07 22:57:25,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:25,515 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:25,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 22:57:25,515 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash 348143711, now seen corresponding path program 1 times [2025-02-07 22:57:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128349754] [2025-02-07 22:57:25,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:25,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-07 22:57:25,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-07 22:57:25,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:25,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:26,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:26,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128349754] [2025-02-07 22:57:26,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128349754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:26,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:26,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:57:26,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486030824] [2025-02-07 22:57:26,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:26,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:26,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:26,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:26,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:26,283 INFO L87 Difference]: Start difference. First operand 596 states and 820 transitions. Second operand has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:26,825 INFO L93 Difference]: Finished difference Result 1394 states and 1925 transitions. [2025-02-07 22:57:26,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:26,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2025-02-07 22:57:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:26,829 INFO L225 Difference]: With dead ends: 1394 [2025-02-07 22:57:26,829 INFO L226 Difference]: Without dead ends: 1029 [2025-02-07 22:57:26,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:57:26,830 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 352 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:26,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1954 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:57:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-02-07 22:57:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 917. [2025-02-07 22:57:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 906 states have (on average 1.369757174392936) internal successors, (1241), 906 states have internal predecessors, (1241), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 22:57:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1259 transitions. [2025-02-07 22:57:26,849 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1259 transitions. Word has length 332 [2025-02-07 22:57:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:26,849 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1259 transitions. [2025-02-07 22:57:26,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1259 transitions. [2025-02-07 22:57:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-07 22:57:26,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:26,853 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:26,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 22:57:26,853 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:26,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash 362103805, now seen corresponding path program 1 times [2025-02-07 22:57:26,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:26,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599255568] [2025-02-07 22:57:26,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:26,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-07 22:57:27,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-07 22:57:27,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:27,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-07 22:57:27,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:27,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599255568] [2025-02-07 22:57:27,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599255568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:27,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:27,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438674842] [2025-02-07 22:57:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:27,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:27,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:27,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:27,923 INFO L87 Difference]: Start difference. First operand 917 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:28,257 INFO L93 Difference]: Finished difference Result 1588 states and 2152 transitions. [2025-02-07 22:57:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:57:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 333 [2025-02-07 22:57:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:28,260 INFO L225 Difference]: With dead ends: 1588 [2025-02-07 22:57:28,261 INFO L226 Difference]: Without dead ends: 941 [2025-02-07 22:57:28,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:28,262 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 325 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:28,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1001 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:57:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-02-07 22:57:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 935. [2025-02-07 22:57:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 924 states have (on average 1.3625541125541125) internal successors, (1259), 924 states have internal predecessors, (1259), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 22:57:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1277 transitions. [2025-02-07 22:57:28,297 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1277 transitions. Word has length 333 [2025-02-07 22:57:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:28,297 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1277 transitions. [2025-02-07 22:57:28,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1277 transitions. [2025-02-07 22:57:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-07 22:57:28,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:28,299 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:28,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 22:57:28,300 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:28,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2042418315, now seen corresponding path program 1 times [2025-02-07 22:57:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468412995] [2025-02-07 22:57:28,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:28,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-07 22:57:28,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-07 22:57:28,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:28,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-02-07 22:57:29,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:29,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468412995] [2025-02-07 22:57:29,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468412995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:29,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:29,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:57:29,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776261408] [2025-02-07 22:57:29,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:29,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:29,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:29,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:29,037 INFO L87 Difference]: Start difference. First operand 935 states and 1277 transitions. Second operand has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 states have internal predecessors, (272), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:29,291 INFO L93 Difference]: Finished difference Result 2076 states and 2808 transitions. [2025-02-07 22:57:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:29,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 states have internal predecessors, (272), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2025-02-07 22:57:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:29,297 INFO L225 Difference]: With dead ends: 2076 [2025-02-07 22:57:29,297 INFO L226 Difference]: Without dead ends: 1399 [2025-02-07 22:57:29,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:57:29,299 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 855 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:29,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 2075 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-02-07 22:57:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1173. [2025-02-07 22:57:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1156 states have (on average 1.3797577854671281) internal successors, (1595), 1156 states have internal predecessors, (1595), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-07 22:57:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1625 transitions. [2025-02-07 22:57:29,325 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1625 transitions. Word has length 335 [2025-02-07 22:57:29,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:29,326 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1625 transitions. [2025-02-07 22:57:29,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 6 states have internal predecessors, (272), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1625 transitions. [2025-02-07 22:57:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-07 22:57:29,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:29,328 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:29,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 22:57:29,329 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:29,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 488329594, now seen corresponding path program 1 times [2025-02-07 22:57:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975255712] [2025-02-07 22:57:29,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:29,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-07 22:57:29,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-07 22:57:29,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:29,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-02-07 22:57:30,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:30,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975255712] [2025-02-07 22:57:30,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975255712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:30,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:30,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:57:30,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118961614] [2025-02-07 22:57:30,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:30,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:57:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:30,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:57:30,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:57:30,360 INFO L87 Difference]: Start difference. First operand 1173 states and 1625 transitions. Second operand has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:30,726 INFO L93 Difference]: Finished difference Result 2336 states and 3229 transitions. [2025-02-07 22:57:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:57:30,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 335 [2025-02-07 22:57:30,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:30,729 INFO L225 Difference]: With dead ends: 2336 [2025-02-07 22:57:30,729 INFO L226 Difference]: Without dead ends: 1193 [2025-02-07 22:57:30,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:57:30,732 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 536 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:30,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 2278 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:57:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-02-07 22:57:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1183. [2025-02-07 22:57:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1166 states have (on average 1.3722126929674099) internal successors, (1600), 1166 states have internal predecessors, (1600), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-07 22:57:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1630 transitions. [2025-02-07 22:57:30,753 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1630 transitions. Word has length 335 [2025-02-07 22:57:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:30,754 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1630 transitions. [2025-02-07 22:57:30,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 states have internal predecessors, (275), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1630 transitions. [2025-02-07 22:57:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-02-07 22:57:30,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:30,757 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:30,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 22:57:30,757 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:30,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:30,758 INFO L85 PathProgramCache]: Analyzing trace with hash 756299544, now seen corresponding path program 1 times [2025-02-07 22:57:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:30,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824793109] [2025-02-07 22:57:30,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:30,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-07 22:57:31,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-07 22:57:31,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:31,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-07 22:57:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824793109] [2025-02-07 22:57:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824793109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:31,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:31,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:31,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674203839] [2025-02-07 22:57:31,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:31,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:31,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:31,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:31,852 INFO L87 Difference]: Start difference. First operand 1183 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:32,076 INFO L93 Difference]: Finished difference Result 1838 states and 2500 transitions. [2025-02-07 22:57:32,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:32,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 337 [2025-02-07 22:57:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:32,079 INFO L225 Difference]: With dead ends: 1838 [2025-02-07 22:57:32,079 INFO L226 Difference]: Without dead ends: 1183 [2025-02-07 22:57:32,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:32,081 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 317 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:32,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 678 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-02-07 22:57:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1165. [2025-02-07 22:57:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1148 states have (on average 1.372822299651568) internal successors, (1576), 1148 states have internal predecessors, (1576), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-07 22:57:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1606 transitions. [2025-02-07 22:57:32,101 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1606 transitions. Word has length 337 [2025-02-07 22:57:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:32,102 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1606 transitions. [2025-02-07 22:57:32,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1606 transitions. [2025-02-07 22:57:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-02-07 22:57:32,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:32,105 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:32,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 22:57:32,105 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:32,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:32,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1039776073, now seen corresponding path program 1 times [2025-02-07 22:57:32,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:32,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325462707] [2025-02-07 22:57:32,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:32,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:32,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-07 22:57:32,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-07 22:57:32,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:32,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:32,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:32,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325462707] [2025-02-07 22:57:32,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325462707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:32,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:32,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:57:32,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280379069] [2025-02-07 22:57:32,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:32,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:32,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:32,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:32,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:32,899 INFO L87 Difference]: Start difference. First operand 1165 states and 1606 transitions. Second operand has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:33,312 INFO L93 Difference]: Finished difference Result 1555 states and 2141 transitions. [2025-02-07 22:57:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:33,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 337 [2025-02-07 22:57:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:33,315 INFO L225 Difference]: With dead ends: 1555 [2025-02-07 22:57:33,315 INFO L226 Difference]: Without dead ends: 1188 [2025-02-07 22:57:33,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:57:33,316 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 761 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:33,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1316 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:57:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-02-07 22:57:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1166. [2025-02-07 22:57:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1149 states have (on average 1.3724978241949521) internal successors, (1577), 1149 states have internal predecessors, (1577), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-07 22:57:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1607 transitions. [2025-02-07 22:57:33,334 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1607 transitions. Word has length 337 [2025-02-07 22:57:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:33,334 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1607 transitions. [2025-02-07 22:57:33,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1607 transitions. [2025-02-07 22:57:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-02-07 22:57:33,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:33,337 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:33,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 22:57:33,337 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:33,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash 85252462, now seen corresponding path program 1 times [2025-02-07 22:57:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:33,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544569000] [2025-02-07 22:57:33,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:33,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:33,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-07 22:57:33,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-07 22:57:33,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:33,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-07 22:57:34,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:34,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544569000] [2025-02-07 22:57:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544569000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:34,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:34,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:57:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490080813] [2025-02-07 22:57:34,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:34,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:57:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:34,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:57:34,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:57:34,525 INFO L87 Difference]: Start difference. First operand 1166 states and 1607 transitions. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:35,661 INFO L93 Difference]: Finished difference Result 2551 states and 3500 transitions. [2025-02-07 22:57:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:57:35,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 337 [2025-02-07 22:57:35,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:35,666 INFO L225 Difference]: With dead ends: 2551 [2025-02-07 22:57:35,666 INFO L226 Difference]: Without dead ends: 2044 [2025-02-07 22:57:35,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:57:35,667 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 1313 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 3962 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:35,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 3962 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 22:57:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2025-02-07 22:57:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1304. [2025-02-07 22:57:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1281 states have (on average 1.3747072599531616) internal successors, (1761), 1281 states have internal predecessors, (1761), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-07 22:57:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1803 transitions. [2025-02-07 22:57:35,689 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1803 transitions. Word has length 337 [2025-02-07 22:57:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:35,689 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1803 transitions. [2025-02-07 22:57:35,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1803 transitions. [2025-02-07 22:57:35,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-07 22:57:35,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:35,692 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:35,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 22:57:35,693 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:35,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:35,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1121505732, now seen corresponding path program 1 times [2025-02-07 22:57:35,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:35,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274339939] [2025-02-07 22:57:35,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:35,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:35,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-07 22:57:36,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-07 22:57:36,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:36,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-07 22:57:36,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:36,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274339939] [2025-02-07 22:57:36,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274339939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:36,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243537345] [2025-02-07 22:57:36,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:36,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:36,649 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-07 22:57:36,649 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-07 22:57:37,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-07 22:57:37,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-07 22:57:37,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:37,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:37,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-07 22:57:37,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-02-07 22:57:37,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:57:37,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243537345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:37,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:57:37,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-02-07 22:57:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234433771] [2025-02-07 22:57:37,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:37,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:37,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:37,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:57:37,583 INFO L87 Difference]: Start difference. First operand 1304 states and 1803 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:37,977 INFO L93 Difference]: Finished difference Result 2378 states and 3264 transitions. [2025-02-07 22:57:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:37,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 338 [2025-02-07 22:57:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:37,980 INFO L225 Difference]: With dead ends: 2378 [2025-02-07 22:57:37,980 INFO L226 Difference]: Without dead ends: 1332 [2025-02-07 22:57:37,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:57:37,982 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 503 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:37,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1294 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:57:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-02-07 22:57:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1325. [2025-02-07 22:57:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1302 states have (on average 1.3632872503840245) internal successors, (1775), 1302 states have internal predecessors, (1775), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-07 22:57:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1817 transitions. [2025-02-07 22:57:38,003 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1817 transitions. Word has length 338 [2025-02-07 22:57:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:38,003 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1817 transitions. [2025-02-07 22:57:38,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 5 states have internal predecessors, (238), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:57:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1817 transitions. [2025-02-07 22:57:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-02-07 22:57:38,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:38,006 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:38,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 22:57:38,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-07 22:57:38,210 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1051961444, now seen corresponding path program 1 times [2025-02-07 22:57:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:38,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958740176] [2025-02-07 22:57:38,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:38,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:38,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-02-07 22:57:38,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-02-07 22:57:38,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:38,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:39,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958740176] [2025-02-07 22:57:39,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958740176] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:39,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510916125] [2025-02-07 22:57:39,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:39,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:39,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:39,661 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-07 22:57:39,662 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-07 22:57:40,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-02-07 22:57:40,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-02-07 22:57:40,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:40,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:40,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 2053 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-07 22:57:40,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-07 22:57:40,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:57:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510916125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:40,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:57:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-02-07 22:57:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732107105] [2025-02-07 22:57:40,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:40,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:57:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:40,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:57:40,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-02-07 22:57:40,694 INFO L87 Difference]: Start difference. First operand 1325 states and 1817 transitions. Second operand has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 22:57:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:41,249 INFO L93 Difference]: Finished difference Result 2272 states and 3109 transitions. [2025-02-07 22:57:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:57:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 342 [2025-02-07 22:57:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:41,253 INFO L225 Difference]: With dead ends: 2272 [2025-02-07 22:57:41,253 INFO L226 Difference]: Without dead ends: 1367 [2025-02-07 22:57:41,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-02-07 22:57:41,258 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 496 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:41,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2214 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:57:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-02-07 22:57:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1353. [2025-02-07 22:57:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1330 states have (on average 1.350375939849624) internal successors, (1796), 1330 states have internal predecessors, (1796), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-07 22:57:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1838 transitions. [2025-02-07 22:57:41,293 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1838 transitions. Word has length 342 [2025-02-07 22:57:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:41,293 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1838 transitions. [2025-02-07 22:57:41,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.333333333333332) internal successors, (264), 9 states have internal predecessors, (264), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 22:57:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1838 transitions. [2025-02-07 22:57:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-07 22:57:41,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:41,298 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:41,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 22:57:41,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:41,498 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:41,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1612515804, now seen corresponding path program 1 times [2025-02-07 22:57:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320112862] [2025-02-07 22:57:41,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:41,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:57:42,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:57:42,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:42,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:43,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:43,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320112862] [2025-02-07 22:57:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320112862] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:43,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736527892] [2025-02-07 22:57:43,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:43,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:43,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:43,159 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-07 22:57:43,164 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-07 22:57:43,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:57:44,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:57:44,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:44,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:44,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 22:57:44,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-07 22:57:44,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:57:44,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736527892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:44,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:57:44,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-02-07 22:57:44,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915676414] [2025-02-07 22:57:44,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:44,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:44,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:44,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:44,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:57:44,256 INFO L87 Difference]: Start difference. First operand 1353 states and 1838 transitions. Second operand has 6 states, 5 states have (on average 59.0) internal successors, (295), 6 states have internal predecessors, (295), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 22:57:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:44,483 INFO L93 Difference]: Finished difference Result 2180 states and 2947 transitions. [2025-02-07 22:57:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:44,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 59.0) internal successors, (295), 6 states have internal predecessors, (295), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 348 [2025-02-07 22:57:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:44,487 INFO L225 Difference]: With dead ends: 2180 [2025-02-07 22:57:44,487 INFO L226 Difference]: Without dead ends: 1353 [2025-02-07 22:57:44,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:57:44,488 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 0 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:44,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2231 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-02-07 22:57:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2025-02-07 22:57:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1330 states have (on average 1.3451127819548871) internal successors, (1789), 1330 states have internal predecessors, (1789), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-07 22:57:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1831 transitions. [2025-02-07 22:57:44,512 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1831 transitions. Word has length 348 [2025-02-07 22:57:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:44,512 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1831 transitions. [2025-02-07 22:57:44,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 59.0) internal successors, (295), 6 states have internal predecessors, (295), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 22:57:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1831 transitions. [2025-02-07 22:57:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-07 22:57:44,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:44,514 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:44,532 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-07 22:57:44,714 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,SelfDestructingSolverStorable38 [2025-02-07 22:57:44,715 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:44,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash -543117042, now seen corresponding path program 1 times [2025-02-07 22:57:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023327340] [2025-02-07 22:57:44,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:44,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:57:45,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:57:45,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:45,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023327340] [2025-02-07 22:57:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023327340] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513537563] [2025-02-07 22:57:46,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:46,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:46,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:46,164 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-07 22:57:46,165 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-07 22:57:46,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:57:47,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:57:47,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:47,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:47,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 22:57:47,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-07 22:57:47,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:57:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513537563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:47,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:57:47,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-02-07 22:57:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40462772] [2025-02-07 22:57:47,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:47,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:57:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:47,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:57:47,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-02-07 22:57:47,276 INFO L87 Difference]: Start difference. First operand 1353 states and 1831 transitions. Second operand has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:47,805 INFO L93 Difference]: Finished difference Result 2886 states and 3900 transitions. [2025-02-07 22:57:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:57:47,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348 [2025-02-07 22:57:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:47,810 INFO L225 Difference]: With dead ends: 2886 [2025-02-07 22:57:47,810 INFO L226 Difference]: Without dead ends: 2369 [2025-02-07 22:57:47,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-07 22:57:47,811 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1691 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:47,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 1645 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:57:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-02-07 22:57:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2023. [2025-02-07 22:57:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2023 states, 1982 states have (on average 1.32744702320888) internal successors, (2631), 1982 states have internal predecessors, (2631), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-07 22:57:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2709 transitions. [2025-02-07 22:57:47,868 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2709 transitions. Word has length 348 [2025-02-07 22:57:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:47,868 INFO L471 AbstractCegarLoop]: Abstraction has 2023 states and 2709 transitions. [2025-02-07 22:57:47,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2709 transitions. [2025-02-07 22:57:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-07 22:57:47,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:47,873 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:47,886 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-07 22:57:48,074 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,SelfDestructingSolverStorable39 [2025-02-07 22:57:48,074 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:48,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash -772027721, now seen corresponding path program 1 times [2025-02-07 22:57:48,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:48,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586387381] [2025-02-07 22:57:48,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:48,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-07 22:57:48,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-07 22:57:48,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:48,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-07 22:57:48,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:48,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586387381] [2025-02-07 22:57:48,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586387381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:48,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:48,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318323963] [2025-02-07 22:57:48,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:48,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:48,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:48,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:48,598 INFO L87 Difference]: Start difference. First operand 2023 states and 2709 transitions. Second operand has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:48,763 INFO L93 Difference]: Finished difference Result 2896 states and 3889 transitions. [2025-02-07 22:57:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:57:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348 [2025-02-07 22:57:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:48,768 INFO L225 Difference]: With dead ends: 2896 [2025-02-07 22:57:48,768 INFO L226 Difference]: Without dead ends: 2185 [2025-02-07 22:57:48,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-07 22:57:48,769 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 16 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:48,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1790 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:57:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2025-02-07 22:57:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2185. [2025-02-07 22:57:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2185 states, 2144 states have (on average 1.336287313432836) internal successors, (2865), 2144 states have internal predecessors, (2865), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-07 22:57:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 2943 transitions. [2025-02-07 22:57:48,799 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 2943 transitions. Word has length 348 [2025-02-07 22:57:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:48,799 INFO L471 AbstractCegarLoop]: Abstraction has 2185 states and 2943 transitions. [2025-02-07 22:57:48,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2943 transitions. [2025-02-07 22:57:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-02-07 22:57:48,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:48,803 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:48,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 22:57:48,803 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:48,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash -869651288, now seen corresponding path program 1 times [2025-02-07 22:57:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:48,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949725607] [2025-02-07 22:57:48,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:48,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-07 22:57:49,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-07 22:57:49,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:49,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:50,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:50,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949725607] [2025-02-07 22:57:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949725607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:50,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437210088] [2025-02-07 22:57:50,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:50,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:50,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:50,523 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-07 22:57:50,525 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-07 22:57:51,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-02-07 22:57:51,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-02-07 22:57:51,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:51,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:51,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-07 22:57:51,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:57:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:51,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:57:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:51,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437210088] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:51,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:57:51,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 8] total 22 [2025-02-07 22:57:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012629651] [2025-02-07 22:57:51,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:51,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:57:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:51,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:57:51,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-02-07 22:57:51,996 INFO L87 Difference]: Start difference. First operand 2185 states and 2943 transitions. Second operand has 7 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:52,446 INFO L93 Difference]: Finished difference Result 2967 states and 4004 transitions. [2025-02-07 22:57:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:57:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 349 [2025-02-07 22:57:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:52,453 INFO L225 Difference]: With dead ends: 2967 [2025-02-07 22:57:52,453 INFO L226 Difference]: Without dead ends: 2575 [2025-02-07 22:57:52,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2025-02-07 22:57:52,454 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 352 mSDsluCounter, 3628 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:52,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 4428 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:57:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2025-02-07 22:57:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2372. [2025-02-07 22:57:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 2328 states have (on average 1.331615120274914) internal successors, (3100), 2328 states have internal predecessors, (3100), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-07 22:57:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3184 transitions. [2025-02-07 22:57:52,499 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3184 transitions. Word has length 349 [2025-02-07 22:57:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:52,499 INFO L471 AbstractCegarLoop]: Abstraction has 2372 states and 3184 transitions. [2025-02-07 22:57:52,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.0) internal successors, (322), 7 states have internal predecessors, (322), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3184 transitions. [2025-02-07 22:57:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-07 22:57:52,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:52,503 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:52,518 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-07 22:57:52,703 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,SelfDestructingSolverStorable41 [2025-02-07 22:57:52,704 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:52,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash -489588388, now seen corresponding path program 1 times [2025-02-07 22:57:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:52,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970584577] [2025-02-07 22:57:52,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:52,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-07 22:57:53,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-07 22:57:53,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:53,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-07 22:57:54,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970584577] [2025-02-07 22:57:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970584577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 22:57:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975980258] [2025-02-07 22:57:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:54,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 22:57:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:54,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 22:57:54,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:57:54,352 INFO L87 Difference]: Start difference. First operand 2372 states and 3184 transitions. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:55,601 INFO L93 Difference]: Finished difference Result 5143 states and 6794 transitions. [2025-02-07 22:57:55,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:57:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 350 [2025-02-07 22:57:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:55,610 INFO L225 Difference]: With dead ends: 5143 [2025-02-07 22:57:55,611 INFO L226 Difference]: Without dead ends: 3959 [2025-02-07 22:57:55,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-02-07 22:57:55,614 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 1357 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:55,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 3180 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 22:57:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2025-02-07 22:57:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 2870. [2025-02-07 22:57:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2870 states, 2812 states have (on average 1.3321479374110954) internal successors, (3746), 2812 states have internal predecessors, (3746), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-07 22:57:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 3858 transitions. [2025-02-07 22:57:55,663 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 3858 transitions. Word has length 350 [2025-02-07 22:57:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:55,663 INFO L471 AbstractCegarLoop]: Abstraction has 2870 states and 3858 transitions. [2025-02-07 22:57:55,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 3858 transitions. [2025-02-07 22:57:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:57:55,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:55,667 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:55,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 22:57:55,667 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:55,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1890793714, now seen corresponding path program 1 times [2025-02-07 22:57:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:55,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781767295] [2025-02-07 22:57:55,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:55,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:57:56,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:57:56,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:56,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-07 22:57:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781767295] [2025-02-07 22:57:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781767295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:58,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:58,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 22:57:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375486637] [2025-02-07 22:57:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:58,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:57:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:58,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:57:58,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:57:58,065 INFO L87 Difference]: Start difference. First operand 2870 states and 3858 transitions. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:58,818 INFO L93 Difference]: Finished difference Result 4843 states and 6496 transitions. [2025-02-07 22:57:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 22:57:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 352 [2025-02-07 22:57:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:58,824 INFO L225 Difference]: With dead ends: 4843 [2025-02-07 22:57:58,824 INFO L226 Difference]: Without dead ends: 3694 [2025-02-07 22:57:58,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:57:58,826 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1636 mSDsluCounter, 4207 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 4896 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:58,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 4896 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2025-02-07 22:57:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3126. [2025-02-07 22:57:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 3056 states have (on average 1.3265706806282722) internal successors, (4054), 3056 states have internal predecessors, (4054), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-07 22:57:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4190 transitions. [2025-02-07 22:57:58,877 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4190 transitions. Word has length 352 [2025-02-07 22:57:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:58,877 INFO L471 AbstractCegarLoop]: Abstraction has 3126 states and 4190 transitions. [2025-02-07 22:57:58,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:57:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4190 transitions. [2025-02-07 22:57:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:57:58,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:58,882 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:57:58,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 22:57:58,882 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:58,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash 443005273, now seen corresponding path program 1 times [2025-02-07 22:57:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:58,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613272443] [2025-02-07 22:57:58,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:58,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:57:59,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:57:59,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:59,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 51 proven. 39 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:58:02,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613272443] [2025-02-07 22:58:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613272443] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:58:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978351214] [2025-02-07 22:58:02,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:02,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:02,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:02,947 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-07 22:58:02,974 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-07 22:58:03,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:58:04,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:58:04,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:04,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:04,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 2075 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 22:58:04,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:58:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-02-07 22:58:04,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:58:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978351214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:58:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2025-02-07 22:58:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548256784] [2025-02-07 22:58:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:04,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:58:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:04,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:58:04,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-02-07 22:58:04,186 INFO L87 Difference]: Start difference. First operand 3126 states and 4190 transitions. Second operand has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-07 22:58:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:04,407 INFO L93 Difference]: Finished difference Result 5304 states and 7100 transitions. [2025-02-07 22:58:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:58:04,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 352 [2025-02-07 22:58:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:04,413 INFO L225 Difference]: With dead ends: 5304 [2025-02-07 22:58:04,413 INFO L226 Difference]: Without dead ends: 3126 [2025-02-07 22:58:04,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-02-07 22:58:04,416 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 0 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:04,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2232 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:58:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2025-02-07 22:58:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3126. [2025-02-07 22:58:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 3056 states have (on average 1.3219895287958114) internal successors, (4040), 3056 states have internal predecessors, (4040), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-07 22:58:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4176 transitions. [2025-02-07 22:58:04,468 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4176 transitions. Word has length 352 [2025-02-07 22:58:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:04,468 INFO L471 AbstractCegarLoop]: Abstraction has 3126 states and 4176 transitions. [2025-02-07 22:58:04,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-07 22:58:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4176 transitions. [2025-02-07 22:58:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:58:04,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:04,473 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:58:04,488 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-07 22:58:04,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:04,674 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:04,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 838172720, now seen corresponding path program 1 times [2025-02-07 22:58:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337840153] [2025-02-07 22:58:04,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:04,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:58:05,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:58:05,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:05,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-07 22:58:05,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:05,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337840153] [2025-02-07 22:58:05,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337840153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:05,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:05,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:58:05,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563992798] [2025-02-07 22:58:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:05,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:58:05,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:05,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:58:05,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:58:05,869 INFO L87 Difference]: Start difference. First operand 3126 states and 4176 transitions. Second operand has 8 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:58:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:06,894 INFO L93 Difference]: Finished difference Result 6160 states and 8252 transitions. [2025-02-07 22:58:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:58:06,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2025-02-07 22:58:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:06,907 INFO L225 Difference]: With dead ends: 6160 [2025-02-07 22:58:06,907 INFO L226 Difference]: Without dead ends: 5054 [2025-02-07 22:58:06,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:58:06,911 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1272 mSDsluCounter, 2884 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 3678 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:06,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 3678 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 22:58:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2025-02-07 22:58:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 3128. [2025-02-07 22:58:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3058 states have (on average 1.3224329627207325) internal successors, (4044), 3058 states have internal predecessors, (4044), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-07 22:58:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4180 transitions. [2025-02-07 22:58:06,971 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4180 transitions. Word has length 352 [2025-02-07 22:58:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:06,971 INFO L471 AbstractCegarLoop]: Abstraction has 3128 states and 4180 transitions. [2025-02-07 22:58:06,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.125) internal successors, (273), 8 states have internal predecessors, (273), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:58:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4180 transitions. [2025-02-07 22:58:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:58:06,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:06,977 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:58:06,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 22:58:06,977 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:06,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1735206244, now seen corresponding path program 1 times [2025-02-07 22:58:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281532555] [2025-02-07 22:58:06,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:07,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:58:07,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:58:07,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:07,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:58:07,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:07,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281532555] [2025-02-07 22:58:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281532555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:07,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:07,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:58:07,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336021449] [2025-02-07 22:58:07,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:07,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:58:07,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:07,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:58:07,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:58:08,000 INFO L87 Difference]: Start difference. First operand 3128 states and 4180 transitions. Second operand has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:58:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:08,598 INFO L93 Difference]: Finished difference Result 4761 states and 6372 transitions. [2025-02-07 22:58:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:58:08,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2025-02-07 22:58:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:08,608 INFO L225 Difference]: With dead ends: 4761 [2025-02-07 22:58:08,608 INFO L226 Difference]: Without dead ends: 4096 [2025-02-07 22:58:08,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:58:08,611 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 744 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:08,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2054 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:58:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2025-02-07 22:58:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3274. [2025-02-07 22:58:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3274 states, 3200 states have (on average 1.323125) internal successors, (4234), 3200 states have internal predecessors, (4234), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-07 22:58:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 4378 transitions. [2025-02-07 22:58:08,685 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 4378 transitions. Word has length 352 [2025-02-07 22:58:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:08,685 INFO L471 AbstractCegarLoop]: Abstraction has 3274 states and 4378 transitions. [2025-02-07 22:58:08,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:58:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 4378 transitions. [2025-02-07 22:58:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-02-07 22:58:08,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:08,690 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:58:08,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 22:58:08,690 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:08,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:08,691 INFO L85 PathProgramCache]: Analyzing trace with hash -608335383, now seen corresponding path program 1 times [2025-02-07 22:58:08,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:08,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764915192] [2025-02-07 22:58:08,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:08,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-02-07 22:58:09,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-02-07 22:58:09,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:58:10,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:10,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764915192] [2025-02-07 22:58:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764915192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:10,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:10,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 22:58:10,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661542190] [2025-02-07 22:58:10,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:10,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:58:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:10,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:58:10,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:58:10,054 INFO L87 Difference]: Start difference. First operand 3274 states and 4378 transitions. Second operand has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:58:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:10,984 INFO L93 Difference]: Finished difference Result 7852 states and 10518 transitions. [2025-02-07 22:58:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:58:10,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2025-02-07 22:58:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:10,992 INFO L225 Difference]: With dead ends: 7852 [2025-02-07 22:58:10,992 INFO L226 Difference]: Without dead ends: 7187 [2025-02-07 22:58:10,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:58:10,994 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 2143 mSDsluCounter, 2358 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2149 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:10,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2149 Valid, 2696 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:58:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2025-02-07 22:58:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 3622. [2025-02-07 22:58:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3532 states have (on average 1.3199320498301246) internal successors, (4662), 3532 states have internal predecessors, (4662), 88 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-07 22:58:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4838 transitions. [2025-02-07 22:58:11,073 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4838 transitions. Word has length 352 [2025-02-07 22:58:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:11,074 INFO L471 AbstractCegarLoop]: Abstraction has 3622 states and 4838 transitions. [2025-02-07 22:58:11,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:58:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4838 transitions. [2025-02-07 22:58:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-07 22:58:11,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:11,079 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:58:11,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 22:58:11,080 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:11,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1081680018, now seen corresponding path program 1 times [2025-02-07 22:58:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:11,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906054220] [2025-02-07 22:58:11,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:11,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:58:11,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:58:11,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:11,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-07 22:58:12,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:12,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906054220] [2025-02-07 22:58:12,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906054220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:12,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:12,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:58:12,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961311588] [2025-02-07 22:58:12,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:12,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:58:12,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:12,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:58:12,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:58:12,132 INFO L87 Difference]: Start difference. First operand 3622 states and 4838 transitions. Second operand has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:58:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:12,594 INFO L93 Difference]: Finished difference Result 6407 states and 8562 transitions. [2025-02-07 22:58:12,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:58:12,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 353 [2025-02-07 22:58:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:12,600 INFO L225 Difference]: With dead ends: 6407 [2025-02-07 22:58:12,600 INFO L226 Difference]: Without dead ends: 5242 [2025-02-07 22:58:12,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:58:12,603 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 711 mSDsluCounter, 3171 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 3882 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:12,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 3882 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:58:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2025-02-07 22:58:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 3918. [2025-02-07 22:58:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3816 states have (on average 1.3149895178197064) internal successors, (5018), 3816 states have internal predecessors, (5018), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-07 22:58:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5218 transitions. [2025-02-07 22:58:12,678 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5218 transitions. Word has length 353 [2025-02-07 22:58:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:12,679 INFO L471 AbstractCegarLoop]: Abstraction has 3918 states and 5218 transitions. [2025-02-07 22:58:12,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 22:58:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5218 transitions. [2025-02-07 22:58:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-07 22:58:12,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:12,684 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:58:12,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 22:58:12,685 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:12,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1080791528, now seen corresponding path program 1 times [2025-02-07 22:58:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:12,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430358204] [2025-02-07 22:58:12,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:12,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:58:12,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:58:12,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:12,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-07 22:58:13,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:13,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430358204] [2025-02-07 22:58:13,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430358204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:58:13,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:58:13,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:58:13,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535274189] [2025-02-07 22:58:13,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:58:13,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:58:13,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:13,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:58:13,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:58:13,220 INFO L87 Difference]: Start difference. First operand 3918 states and 5218 transitions. Second operand has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:58:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:58:13,574 INFO L93 Difference]: Finished difference Result 5444 states and 7240 transitions. [2025-02-07 22:58:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:58:13,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 353 [2025-02-07 22:58:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:58:13,578 INFO L225 Difference]: With dead ends: 5444 [2025-02-07 22:58:13,578 INFO L226 Difference]: Without dead ends: 4078 [2025-02-07 22:58:13,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:58:13,580 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 503 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:58:13,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1330 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:58:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2025-02-07 22:58:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 3998. [2025-02-07 22:58:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3998 states, 3896 states have (on average 1.3085215605749487) internal successors, (5098), 3896 states have internal predecessors, (5098), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-07 22:58:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3998 states to 3998 states and 5298 transitions. [2025-02-07 22:58:13,652 INFO L78 Accepts]: Start accepts. Automaton has 3998 states and 5298 transitions. Word has length 353 [2025-02-07 22:58:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:58:13,652 INFO L471 AbstractCegarLoop]: Abstraction has 3998 states and 5298 transitions. [2025-02-07 22:58:13,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:58:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3998 states and 5298 transitions. [2025-02-07 22:58:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-02-07 22:58:13,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:58:13,658 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:58:13,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-07 22:58:13,658 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:58:13,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:58:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash -853023263, now seen corresponding path program 1 times [2025-02-07 22:58:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:58:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196301548] [2025-02-07 22:58:13,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:13,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:58:13,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:58:14,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:58:14,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:14,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:15,095 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 4 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:58:15,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:58:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196301548] [2025-02-07 22:58:15,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196301548] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:58:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247166962] [2025-02-07 22:58:15,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:58:15,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:58:15,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:58:15,097 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-07 22:58:15,099 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-07 22:58:15,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-02-07 22:58:16,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-02-07 22:58:16,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:58:16,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:58:16,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 2078 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-07 22:58:16,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:58:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 123 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 22:58:16,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:58:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:58:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247166962] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:58:17,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 22:58:17,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2025-02-07 22:58:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512398436] [2025-02-07 22:58:17,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 22:58:17,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 22:58:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:58:17,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 22:58:17,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-02-07 22:58:17,852 INFO L87 Difference]: Start difference. First operand 3998 states and 5298 transitions. Second operand has 23 states, 23 states have (on average 38.30434782608695) internal successors, (881), 23 states have internal predecessors, (881), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18)