./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label25.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a498dbc067f1de398639e507498752ad05d79db17a274a9c2dbfecc9e6d20a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:32:15,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:32:15,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:32:15,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:32:15,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:32:15,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:32:15,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:32:15,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:32:15,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:32:15,611 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:32:15,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:32:15,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:32:15,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:32:15,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:32:15,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:32:15,614 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:32:15,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:32:15,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:32:15,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:32:15,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:32:15,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:32:15,616 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a498dbc067f1de398639e507498752ad05d79db17a274a9c2dbfecc9e6d20a0 [2025-02-05 11:32:15,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:32:15,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:32:15,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:32:15,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:32:15,913 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:32:15,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label25.c [2025-02-05 11:32:17,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/191cd382d/01556d76bb234995b845b340edaf8ed0/FLAG180848d73 [2025-02-05 11:32:17,686 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:32:17,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c [2025-02-05 11:32:17,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/191cd382d/01556d76bb234995b845b340edaf8ed0/FLAG180848d73 [2025-02-05 11:32:17,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/191cd382d/01556d76bb234995b845b340edaf8ed0 [2025-02-05 11:32:17,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:32:17,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:32:17,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:32:17,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:32:17,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:32:17,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:32:17" (1/1) ... [2025-02-05 11:32:17,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0a1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:17, skipping insertion in model container [2025-02-05 11:32:17,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:32:17" (1/1) ... [2025-02-05 11:32:17,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:32:17,973 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/eca-rers2012/Problem11_label25.c[4556,4569] [2025-02-05 11:32:18,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:32:18,245 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:32:18,269 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/eca-rers2012/Problem11_label25.c[4556,4569] [2025-02-05 11:32:18,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:32:18,429 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:32:18,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18 WrapperNode [2025-02-05 11:32:18,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:32:18,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:32:18,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:32:18,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:32:18,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,553 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-02-05 11:32:18,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:32:18,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:32:18,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:32:18,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:32:18,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,646 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:32:18,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:32:18,735 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:32:18,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:32:18,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:32:18,736 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (1/1) ... [2025-02-05 11:32:18,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:32:18,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:32:18,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:32:18,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:32:18,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:32:18,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:32:18,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:32:18,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:32:18,863 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:32:18,865 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:32:20,544 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-05 11:32:20,545 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:32:20,567 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:32:20,568 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:32:20,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:32:20 BoogieIcfgContainer [2025-02-05 11:32:20,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:32:20,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:32:20,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:32:20,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:32:20,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:32:17" (1/3) ... [2025-02-05 11:32:20,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfa047e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:32:20, skipping insertion in model container [2025-02-05 11:32:20,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:18" (2/3) ... [2025-02-05 11:32:20,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfa047e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:32:20, skipping insertion in model container [2025-02-05 11:32:20,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:32:20" (3/3) ... [2025-02-05 11:32:20,580 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label25.c [2025-02-05 11:32:20,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:32:20,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label25.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:32:20,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:32:20,674 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;@5d0cef33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:32:20,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:32:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 11:32:20,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:20,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:20,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash -248332624, now seen corresponding path program 1 times [2025-02-05 11:32:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:20,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275577513] [2025-02-05 11:32:20,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:20,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:20,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 11:32:20,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 11:32:20,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:20,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:21,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275577513] [2025-02-05 11:32:21,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275577513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:21,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:21,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:32:21,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733836879] [2025-02-05 11:32:21,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:21,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:21,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:21,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:21,032 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:22,123 INFO L93 Difference]: Finished difference Result 776 states and 1360 transitions. [2025-02-05 11:32:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:22,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-05 11:32:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:22,135 INFO L225 Difference]: With dead ends: 776 [2025-02-05 11:32:22,135 INFO L226 Difference]: Without dead ends: 413 [2025-02-05 11:32:22,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:22,141 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 196 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:22,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:32:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-05 11:32:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-02-05 11:32:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2025-02-05 11:32:22,198 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 31 [2025-02-05 11:32:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:22,199 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2025-02-05 11:32:22,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2025-02-05 11:32:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 11:32:22,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:22,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:22,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:32:22,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:22,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:22,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1216635962, now seen corresponding path program 1 times [2025-02-05 11:32:22,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:22,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307254957] [2025-02-05 11:32:22,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:22,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:22,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 11:32:22,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 11:32:22,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:22,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:22,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:22,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307254957] [2025-02-05 11:32:22,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307254957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:22,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:22,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:32:22,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644882124] [2025-02-05 11:32:22,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:22,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:22,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:22,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:22,477 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:23,246 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2025-02-05 11:32:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:23,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-05 11:32:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:23,251 INFO L225 Difference]: With dead ends: 1209 [2025-02-05 11:32:23,251 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 11:32:23,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:23,253 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:23,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 121 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 11:32:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2025-02-05 11:32:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2025-02-05 11:32:23,281 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 99 [2025-02-05 11:32:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:23,281 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2025-02-05 11:32:23,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2025-02-05 11:32:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 11:32:23,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:23,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:23,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:32:23,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash -706764636, now seen corresponding path program 1 times [2025-02-05 11:32:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665244728] [2025-02-05 11:32:23,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:23,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 11:32:23,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 11:32:23,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:23,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:23,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665244728] [2025-02-05 11:32:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665244728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:23,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:23,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:23,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330957389] [2025-02-05 11:32:23,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:23,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:23,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:23,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:23,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:23,812 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:24,965 INFO L93 Difference]: Finished difference Result 2316 states and 3094 transitions. [2025-02-05 11:32:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-02-05 11:32:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:24,972 INFO L225 Difference]: With dead ends: 2316 [2025-02-05 11:32:24,972 INFO L226 Difference]: Without dead ends: 1531 [2025-02-05 11:32:24,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-05 11:32:24,974 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:24,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:32:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-02-05 11:32:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1528. [2025-02-05 11:32:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.2508185985592666) internal successors, (1910), 1527 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1910 transitions. [2025-02-05 11:32:25,011 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1910 transitions. Word has length 100 [2025-02-05 11:32:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:25,011 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 1910 transitions. [2025-02-05 11:32:25,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1910 transitions. [2025-02-05 11:32:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 11:32:25,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:25,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:25,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:32:25,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:25,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1860321522, now seen corresponding path program 1 times [2025-02-05 11:32:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:25,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430394615] [2025-02-05 11:32:25,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:25,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:25,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 11:32:25,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 11:32:25,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:25,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 11:32:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430394615] [2025-02-05 11:32:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430394615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:25,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:32:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519650278] [2025-02-05 11:32:25,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:25,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:25,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:25,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:25,217 INFO L87 Difference]: Start difference. First operand 1528 states and 1910 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:26,024 INFO L93 Difference]: Finished difference Result 3431 states and 4428 transitions. [2025-02-05 11:32:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:26,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-05 11:32:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:26,032 INFO L225 Difference]: With dead ends: 3431 [2025-02-05 11:32:26,033 INFO L226 Difference]: Without dead ends: 2089 [2025-02-05 11:32:26,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:26,035 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:26,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:32:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-02-05 11:32:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2025-02-05 11:32:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.2274904214559388) internal successors, (2563), 2088 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2563 transitions. [2025-02-05 11:32:26,077 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2563 transitions. Word has length 143 [2025-02-05 11:32:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:26,077 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2563 transitions. [2025-02-05 11:32:26,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2563 transitions. [2025-02-05 11:32:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 11:32:26,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:26,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:26,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:32:26,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:26,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1130629678, now seen corresponding path program 1 times [2025-02-05 11:32:26,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:26,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149402181] [2025-02-05 11:32:26,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:26,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 11:32:26,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 11:32:26,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:26,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:26,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149402181] [2025-02-05 11:32:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149402181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:26,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632434577] [2025-02-05 11:32:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:26,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:26,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:26,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:26,279 INFO L87 Difference]: Start difference. First operand 2089 states and 2563 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:27,048 INFO L93 Difference]: Finished difference Result 5130 states and 6434 transitions. [2025-02-05 11:32:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:27,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-02-05 11:32:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:27,062 INFO L225 Difference]: With dead ends: 5130 [2025-02-05 11:32:27,063 INFO L226 Difference]: Without dead ends: 3227 [2025-02-05 11:32:27,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:27,068 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 204 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:27,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2025-02-05 11:32:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3224. [2025-02-05 11:32:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3224 states, 3223 states have (on average 1.2252559726962458) internal successors, (3949), 3223 states have internal predecessors, (3949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 3949 transitions. [2025-02-05 11:32:27,131 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 3949 transitions. Word has length 158 [2025-02-05 11:32:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:27,132 INFO L471 AbstractCegarLoop]: Abstraction has 3224 states and 3949 transitions. [2025-02-05 11:32:27,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 3949 transitions. [2025-02-05 11:32:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-05 11:32:27,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:27,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:27,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:32:27,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:27,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash 10085756, now seen corresponding path program 1 times [2025-02-05 11:32:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:27,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585189284] [2025-02-05 11:32:27,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:27,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-05 11:32:27,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-05 11:32:27,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:27,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:27,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:27,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585189284] [2025-02-05 11:32:27,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585189284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:27,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:27,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:27,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295640061] [2025-02-05 11:32:27,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:27,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:27,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:27,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:27,364 INFO L87 Difference]: Start difference. First operand 3224 states and 3949 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:28,137 INFO L93 Difference]: Finished difference Result 7757 states and 9619 transitions. [2025-02-05 11:32:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:28,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-02-05 11:32:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:28,155 INFO L225 Difference]: With dead ends: 7757 [2025-02-05 11:32:28,155 INFO L226 Difference]: Without dead ends: 4719 [2025-02-05 11:32:28,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:28,161 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:28,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2025-02-05 11:32:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4515. [2025-02-05 11:32:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4515 states, 4514 states have (on average 1.202038103677448) internal successors, (5426), 4514 states have internal predecessors, (5426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 5426 transitions. [2025-02-05 11:32:28,259 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 5426 transitions. Word has length 211 [2025-02-05 11:32:28,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:28,260 INFO L471 AbstractCegarLoop]: Abstraction has 4515 states and 5426 transitions. [2025-02-05 11:32:28,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:28,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 5426 transitions. [2025-02-05 11:32:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 11:32:28,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:28,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:28,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:32:28,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:28,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash 544884642, now seen corresponding path program 1 times [2025-02-05 11:32:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:28,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399154187] [2025-02-05 11:32:28,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:28,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 11:32:28,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 11:32:28,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:28,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 11:32:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399154187] [2025-02-05 11:32:28,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399154187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:28,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:28,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921336793] [2025-02-05 11:32:28,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:28,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:28,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:28,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:28,482 INFO L87 Difference]: Start difference. First operand 4515 states and 5426 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:29,249 INFO L93 Difference]: Finished difference Result 9965 states and 12031 transitions. [2025-02-05 11:32:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-02-05 11:32:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:29,270 INFO L225 Difference]: With dead ends: 9965 [2025-02-05 11:32:29,270 INFO L226 Difference]: Without dead ends: 5452 [2025-02-05 11:32:29,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:29,276 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 171 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:29,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 346 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2025-02-05 11:32:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 5435. [2025-02-05 11:32:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 5434 states have (on average 1.195436142804564) internal successors, (6496), 5434 states have internal predecessors, (6496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 6496 transitions. [2025-02-05 11:32:29,381 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 6496 transitions. Word has length 212 [2025-02-05 11:32:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:29,381 INFO L471 AbstractCegarLoop]: Abstraction has 5435 states and 6496 transitions. [2025-02-05 11:32:29,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 6496 transitions. [2025-02-05 11:32:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 11:32:29,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:29,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:29,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:32:29,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:29,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:29,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1914242271, now seen corresponding path program 1 times [2025-02-05 11:32:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:29,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698917878] [2025-02-05 11:32:29,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:29,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 11:32:29,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 11:32:29,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:29,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 11:32:29,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698917878] [2025-02-05 11:32:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698917878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:29,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:29,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559254914] [2025-02-05 11:32:29,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:29,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:29,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:29,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:29,604 INFO L87 Difference]: Start difference. First operand 5435 states and 6496 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:30,410 INFO L93 Difference]: Finished difference Result 11987 states and 14464 transitions. [2025-02-05 11:32:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:30,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-02-05 11:32:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:30,431 INFO L225 Difference]: With dead ends: 11987 [2025-02-05 11:32:30,432 INFO L226 Difference]: Without dead ends: 6554 [2025-02-05 11:32:30,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:30,441 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 166 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:30,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 379 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6554 states. [2025-02-05 11:32:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6554 to 6539. [2025-02-05 11:32:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6539 states, 6538 states have (on average 1.1798715203426124) internal successors, (7714), 6538 states have internal predecessors, (7714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6539 states to 6539 states and 7714 transitions. [2025-02-05 11:32:30,559 INFO L78 Accepts]: Start accepts. Automaton has 6539 states and 7714 transitions. Word has length 213 [2025-02-05 11:32:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:30,559 INFO L471 AbstractCegarLoop]: Abstraction has 6539 states and 7714 transitions. [2025-02-05 11:32:30,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 7714 transitions. [2025-02-05 11:32:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 11:32:30,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:30,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:30,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:32:30,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:30,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash 516247443, now seen corresponding path program 1 times [2025-02-05 11:32:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:30,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23050828] [2025-02-05 11:32:30,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:30,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 11:32:30,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 11:32:30,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:30,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:30,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:30,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23050828] [2025-02-05 11:32:30,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23050828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:30,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:30,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:32:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649516497] [2025-02-05 11:32:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:30,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:30,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:30,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:30,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:30,980 INFO L87 Difference]: Start difference. First operand 6539 states and 7714 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:32,372 INFO L93 Difference]: Finished difference Result 20129 states and 24016 transitions. [2025-02-05 11:32:32,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2025-02-05 11:32:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:32,422 INFO L225 Difference]: With dead ends: 20129 [2025-02-05 11:32:32,422 INFO L226 Difference]: Without dead ends: 13592 [2025-02-05 11:32:32,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-05 11:32:32,433 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 303 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:32,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 229 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:32:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13592 states. [2025-02-05 11:32:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13592 to 11544. [2025-02-05 11:32:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11544 states, 11543 states have (on average 1.1710127349909036) internal successors, (13517), 11543 states have internal predecessors, (13517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11544 states to 11544 states and 13517 transitions. [2025-02-05 11:32:32,635 INFO L78 Accepts]: Start accepts. Automaton has 11544 states and 13517 transitions. Word has length 233 [2025-02-05 11:32:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:32,636 INFO L471 AbstractCegarLoop]: Abstraction has 11544 states and 13517 transitions. [2025-02-05 11:32:32,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 11544 states and 13517 transitions. [2025-02-05 11:32:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 11:32:32,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:32,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:32,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:32:32,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:32,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1113485580, now seen corresponding path program 1 times [2025-02-05 11:32:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:32,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689584359] [2025-02-05 11:32:32,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:32,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:32,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 11:32:32,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 11:32:32,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:32,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:33,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689584359] [2025-02-05 11:32:33,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689584359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:33,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:33,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:32:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810738157] [2025-02-05 11:32:33,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:33,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:33,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:33,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:33,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:33,094 INFO L87 Difference]: Start difference. First operand 11544 states and 13517 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:34,489 INFO L93 Difference]: Finished difference Result 27896 states and 33100 transitions. [2025-02-05 11:32:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:34,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2025-02-05 11:32:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:34,523 INFO L225 Difference]: With dead ends: 27896 [2025-02-05 11:32:34,523 INFO L226 Difference]: Without dead ends: 16354 [2025-02-05 11:32:34,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-05 11:32:34,534 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 311 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:34,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 132 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:32:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16354 states. [2025-02-05 11:32:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16354 to 15969. [2025-02-05 11:32:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15969 states, 15968 states have (on average 1.1776678356713426) internal successors, (18805), 15968 states have internal predecessors, (18805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15969 states to 15969 states and 18805 transitions. [2025-02-05 11:32:34,714 INFO L78 Accepts]: Start accepts. Automaton has 15969 states and 18805 transitions. Word has length 243 [2025-02-05 11:32:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:34,715 INFO L471 AbstractCegarLoop]: Abstraction has 15969 states and 18805 transitions. [2025-02-05 11:32:34,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 15969 states and 18805 transitions. [2025-02-05 11:32:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 11:32:34,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:34,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:34,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:32:34,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:34,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1859325485, now seen corresponding path program 1 times [2025-02-05 11:32:34,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:34,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965328941] [2025-02-05 11:32:34,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:34,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 11:32:34,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 11:32:34,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:34,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 11:32:34,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:34,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965328941] [2025-02-05 11:32:34,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965328941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:34,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:34,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:34,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130978509] [2025-02-05 11:32:34,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:34,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:34,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:34,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:34,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:34,853 INFO L87 Difference]: Start difference. First operand 15969 states and 18805 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:35,728 INFO L93 Difference]: Finished difference Result 38007 states and 44944 transitions. [2025-02-05 11:32:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:35,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2025-02-05 11:32:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:35,781 INFO L225 Difference]: With dead ends: 38007 [2025-02-05 11:32:35,781 INFO L226 Difference]: Without dead ends: 22040 [2025-02-05 11:32:35,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:35,799 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 169 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:35,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 376 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22040 states. [2025-02-05 11:32:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22040 to 20748. [2025-02-05 11:32:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20748 states, 20747 states have (on average 1.1607943317106089) internal successors, (24083), 20747 states have internal predecessors, (24083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20748 states to 20748 states and 24083 transitions. [2025-02-05 11:32:36,070 INFO L78 Accepts]: Start accepts. Automaton has 20748 states and 24083 transitions. Word has length 245 [2025-02-05 11:32:36,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:36,071 INFO L471 AbstractCegarLoop]: Abstraction has 20748 states and 24083 transitions. [2025-02-05 11:32:36,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 20748 states and 24083 transitions. [2025-02-05 11:32:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-05 11:32:36,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:36,077 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:36,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:32:36,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:36,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1841149103, now seen corresponding path program 1 times [2025-02-05 11:32:36,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:36,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113275804] [2025-02-05 11:32:36,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:36,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-05 11:32:36,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-05 11:32:36,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:36,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 11:32:36,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:36,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113275804] [2025-02-05 11:32:36,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113275804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:36,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:36,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:36,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395645034] [2025-02-05 11:32:36,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:36,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:36,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:36,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:36,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:36,315 INFO L87 Difference]: Start difference. First operand 20748 states and 24083 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:37,245 INFO L93 Difference]: Finished difference Result 41506 states and 48188 transitions. [2025-02-05 11:32:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2025-02-05 11:32:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:37,290 INFO L225 Difference]: With dead ends: 41506 [2025-02-05 11:32:37,290 INFO L226 Difference]: Without dead ends: 20760 [2025-02-05 11:32:37,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:37,311 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 169 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:37,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 376 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:32:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20760 states. [2025-02-05 11:32:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20760 to 20563. [2025-02-05 11:32:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20563 states, 20562 states have (on average 1.1354926563563856) internal successors, (23348), 20562 states have internal predecessors, (23348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20563 states to 20563 states and 23348 transitions. [2025-02-05 11:32:37,660 INFO L78 Accepts]: Start accepts. Automaton has 20563 states and 23348 transitions. Word has length 250 [2025-02-05 11:32:37,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:37,661 INFO L471 AbstractCegarLoop]: Abstraction has 20563 states and 23348 transitions. [2025-02-05 11:32:37,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 20563 states and 23348 transitions. [2025-02-05 11:32:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 11:32:37,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:37,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:37,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:32:37,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:37,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1595402410, now seen corresponding path program 1 times [2025-02-05 11:32:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:37,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722890415] [2025-02-05 11:32:37,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:37,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 11:32:37,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 11:32:37,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:37,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:38,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722890415] [2025-02-05 11:32:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722890415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:38,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:38,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005987895] [2025-02-05 11:32:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:38,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:38,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:38,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:38,071 INFO L87 Difference]: Start difference. First operand 20563 states and 23348 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:39,109 INFO L93 Difference]: Finished difference Result 38134 states and 43345 transitions. [2025-02-05 11:32:39,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:39,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2025-02-05 11:32:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:39,143 INFO L225 Difference]: With dead ends: 38134 [2025-02-05 11:32:39,144 INFO L226 Difference]: Without dead ends: 16837 [2025-02-05 11:32:39,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-05 11:32:39,161 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 192 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:39,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 172 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:32:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16837 states. [2025-02-05 11:32:39,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16837 to 12036. [2025-02-05 11:32:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12036 states, 12035 states have (on average 1.1081844619858745) internal successors, (13337), 12035 states have internal predecessors, (13337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12036 states to 12036 states and 13337 transitions. [2025-02-05 11:32:39,318 INFO L78 Accepts]: Start accepts. Automaton has 12036 states and 13337 transitions. Word has length 264 [2025-02-05 11:32:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:39,319 INFO L471 AbstractCegarLoop]: Abstraction has 12036 states and 13337 transitions. [2025-02-05 11:32:39,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 12036 states and 13337 transitions. [2025-02-05 11:32:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-05 11:32:39,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:39,325 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:39,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:32:39,326 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash -999153925, now seen corresponding path program 1 times [2025-02-05 11:32:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587139681] [2025-02-05 11:32:39,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:39,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-05 11:32:39,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-05 11:32:39,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:39,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-02-05 11:32:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587139681] [2025-02-05 11:32:39,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587139681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:39,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984588779] [2025-02-05 11:32:39,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:39,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:39,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:39,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:39,511 INFO L87 Difference]: Start difference. First operand 12036 states and 13337 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:40,151 INFO L93 Difference]: Finished difference Result 25358 states and 28111 transitions. [2025-02-05 11:32:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-02-05 11:32:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:40,164 INFO L225 Difference]: With dead ends: 25358 [2025-02-05 11:32:40,164 INFO L226 Difference]: Without dead ends: 13324 [2025-02-05 11:32:40,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:40,173 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 162 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:40,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 378 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:32:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2025-02-05 11:32:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12772. [2025-02-05 11:32:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12772 states, 12771 states have (on average 1.1047686163965234) internal successors, (14109), 12771 states have internal predecessors, (14109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 14109 transitions. [2025-02-05 11:32:40,309 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 14109 transitions. Word has length 298 [2025-02-05 11:32:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:40,309 INFO L471 AbstractCegarLoop]: Abstraction has 12772 states and 14109 transitions. [2025-02-05 11:32:40,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 14109 transitions. [2025-02-05 11:32:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-02-05 11:32:40,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:40,318 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:32:40,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:32:40,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:40,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1701760619, now seen corresponding path program 1 times [2025-02-05 11:32:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454436439] [2025-02-05 11:32:40,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:40,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-02-05 11:32:40,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-02-05 11:32:40,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:40,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:32:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:40,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454436439] [2025-02-05 11:32:40,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454436439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:40,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:32:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352207259] [2025-02-05 11:32:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:40,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:40,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:40,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:40,648 INFO L87 Difference]: Start difference. First operand 12772 states and 14109 transitions. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:41,786 INFO L93 Difference]: Finished difference Result 33853 states and 37344 transitions. [2025-02-05 11:32:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:41,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 318 [2025-02-05 11:32:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:41,813 INFO L225 Difference]: With dead ends: 33853 [2025-02-05 11:32:41,813 INFO L226 Difference]: Without dead ends: 20899 [2025-02-05 11:32:41,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-05 11:32:41,827 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 333 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:41,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 86 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:32:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2025-02-05 11:32:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 18495. [2025-02-05 11:32:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18495 states, 18494 states have (on average 1.1002487293176164) internal successors, (20348), 18494 states have internal predecessors, (20348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18495 states to 18495 states and 20348 transitions. [2025-02-05 11:32:42,056 INFO L78 Accepts]: Start accepts. Automaton has 18495 states and 20348 transitions. Word has length 318 [2025-02-05 11:32:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:42,056 INFO L471 AbstractCegarLoop]: Abstraction has 18495 states and 20348 transitions. [2025-02-05 11:32:42,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 18495 states and 20348 transitions. [2025-02-05 11:32:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-05 11:32:42,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:42,065 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:42,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:32:42,066 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:42,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:42,066 INFO L85 PathProgramCache]: Analyzing trace with hash -703624574, now seen corresponding path program 1 times [2025-02-05 11:32:42,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:42,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556331536] [2025-02-05 11:32:42,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:42,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:42,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-05 11:32:42,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-05 11:32:42,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:42,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-02-05 11:32:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:42,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556331536] [2025-02-05 11:32:42,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556331536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:42,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:42,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902799202] [2025-02-05 11:32:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:42,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:42,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:42,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:42,314 INFO L87 Difference]: Start difference. First operand 18495 states and 20348 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:43,030 INFO L93 Difference]: Finished difference Result 39747 states and 43719 transitions. [2025-02-05 11:32:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2025-02-05 11:32:43,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:43,064 INFO L225 Difference]: With dead ends: 39747 [2025-02-05 11:32:43,064 INFO L226 Difference]: Without dead ends: 21254 [2025-02-05 11:32:43,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:43,106 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 188 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:43,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 140 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:32:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21254 states. [2025-02-05 11:32:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21254 to 14809. [2025-02-05 11:32:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.1023095623987034) internal successors, (16323), 14808 states have internal predecessors, (16323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 16323 transitions. [2025-02-05 11:32:43,375 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 16323 transitions. Word has length 325 [2025-02-05 11:32:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:43,376 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 16323 transitions. [2025-02-05 11:32:43,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 16323 transitions. [2025-02-05 11:32:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-05 11:32:43,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:43,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:43,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:32:43,383 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:43,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:43,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2027073207, now seen corresponding path program 1 times [2025-02-05 11:32:43,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:43,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582755999] [2025-02-05 11:32:43,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:43,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-05 11:32:43,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-05 11:32:43,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:43,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:43,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:43,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582755999] [2025-02-05 11:32:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582755999] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:32:43,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141177414] [2025-02-05 11:32:43,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:43,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:32:43,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:32:43,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:32:43,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:32:43,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-05 11:32:43,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-05 11:32:43,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:43,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:43,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:32:43,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:32:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:44,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:32:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:46,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141177414] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:32:46,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:32:46,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-02-05 11:32:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98942162] [2025-02-05 11:32:46,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:32:46,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 11:32:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:46,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 11:32:46,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:32:46,118 INFO L87 Difference]: Start difference. First operand 14809 states and 16323 transitions. Second operand has 10 states, 10 states have (on average 68.9) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:49,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:49,100 INFO L93 Difference]: Finished difference Result 32148 states and 35231 transitions. [2025-02-05 11:32:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 11:32:49,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 68.9) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 329 [2025-02-05 11:32:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:49,137 INFO L225 Difference]: With dead ends: 32148 [2025-02-05 11:32:49,137 INFO L226 Difference]: Without dead ends: 32146 [2025-02-05 11:32:49,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:32:49,147 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1220 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 3965 mSolverCounterSat, 819 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 4784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 819 IncrementalHoareTripleChecker+Valid, 3965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:49,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 208 Invalid, 4784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [819 Valid, 3965 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:32:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32146 states. [2025-02-05 11:32:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32146 to 15922. [2025-02-05 11:32:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15922 states, 15921 states have (on average 1.104264807486967) internal successors, (17581), 15921 states have internal predecessors, (17581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15922 states to 15922 states and 17581 transitions. [2025-02-05 11:32:49,399 INFO L78 Accepts]: Start accepts. Automaton has 15922 states and 17581 transitions. Word has length 329 [2025-02-05 11:32:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:49,400 INFO L471 AbstractCegarLoop]: Abstraction has 15922 states and 17581 transitions. [2025-02-05 11:32:49,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.9) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 15922 states and 17581 transitions. [2025-02-05 11:32:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-02-05 11:32:49,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:49,411 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:32:49,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:32:49,611 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,SelfDestructingSolverStorable16 [2025-02-05 11:32:49,611 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:49,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:49,612 INFO L85 PathProgramCache]: Analyzing trace with hash 42015592, now seen corresponding path program 1 times [2025-02-05 11:32:49,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:49,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553797882] [2025-02-05 11:32:49,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:49,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-02-05 11:32:49,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-02-05 11:32:49,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:49,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 11:32:49,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:49,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553797882] [2025-02-05 11:32:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553797882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:49,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110302803] [2025-02-05 11:32:49,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:49,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:49,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:49,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:49,948 INFO L87 Difference]: Start difference. First operand 15922 states and 17581 transitions. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:50,888 INFO L93 Difference]: Finished difference Result 39586 states and 43625 transitions. [2025-02-05 11:32:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:50,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 446 [2025-02-05 11:32:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:50,912 INFO L225 Difference]: With dead ends: 39586 [2025-02-05 11:32:50,912 INFO L226 Difference]: Without dead ends: 22930 [2025-02-05 11:32:50,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-05 11:32:50,927 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 231 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:50,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 74 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:32:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22930 states. [2025-02-05 11:32:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22930 to 21081. [2025-02-05 11:32:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21081 states, 21080 states have (on average 1.1031309297912713) internal successors, (23254), 21080 states have internal predecessors, (23254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21081 states to 21081 states and 23254 transitions. [2025-02-05 11:32:51,113 INFO L78 Accepts]: Start accepts. Automaton has 21081 states and 23254 transitions. Word has length 446 [2025-02-05 11:32:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:51,113 INFO L471 AbstractCegarLoop]: Abstraction has 21081 states and 23254 transitions. [2025-02-05 11:32:51,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 21081 states and 23254 transitions. [2025-02-05 11:32:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-05 11:32:51,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:51,124 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:51,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:32:51,125 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:51,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash -2123084454, now seen corresponding path program 1 times [2025-02-05 11:32:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522244054] [2025-02-05 11:32:51,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:51,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-05 11:32:51,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-05 11:32:51,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:51,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-02-05 11:32:51,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:51,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522244054] [2025-02-05 11:32:51,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522244054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:51,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:51,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:51,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425073284] [2025-02-05 11:32:51,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:51,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:51,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:51,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:51,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:51,605 INFO L87 Difference]: Start difference. First operand 21081 states and 23254 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:52,316 INFO L93 Difference]: Finished difference Result 43450 states and 47817 transitions. [2025-02-05 11:32:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:52,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 447 [2025-02-05 11:32:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:52,343 INFO L225 Difference]: With dead ends: 43450 [2025-02-05 11:32:52,344 INFO L226 Difference]: Without dead ends: 21819 [2025-02-05 11:32:52,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-05 11:32:52,359 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 213 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:52,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 151 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:32:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21819 states. [2025-02-05 11:32:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21819 to 20161. [2025-02-05 11:32:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20161 states, 20160 states have (on average 1.0975198412698413) internal successors, (22126), 20160 states have internal predecessors, (22126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20161 states to 20161 states and 22126 transitions. [2025-02-05 11:32:52,662 INFO L78 Accepts]: Start accepts. Automaton has 20161 states and 22126 transitions. Word has length 447 [2025-02-05 11:32:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:52,663 INFO L471 AbstractCegarLoop]: Abstraction has 20161 states and 22126 transitions. [2025-02-05 11:32:52,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 20161 states and 22126 transitions. [2025-02-05 11:32:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-02-05 11:32:52,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:52,679 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:32:52,679 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:52,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1271035952, now seen corresponding path program 1 times [2025-02-05 11:32:52,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743653434] [2025-02-05 11:32:52,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:52,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-02-05 11:32:52,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-02-05 11:32:52,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:52,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-02-05 11:32:53,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743653434] [2025-02-05 11:32:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743653434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:53,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:53,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:32:53,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428135849] [2025-02-05 11:32:53,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:53,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:53,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:53,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:53,606 INFO L87 Difference]: Start difference. First operand 20161 states and 22126 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:54,623 INFO L93 Difference]: Finished difference Result 44015 states and 48201 transitions. [2025-02-05 11:32:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 496 [2025-02-05 11:32:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:54,645 INFO L225 Difference]: With dead ends: 44015 [2025-02-05 11:32:54,646 INFO L226 Difference]: Without dead ends: 21642 [2025-02-05 11:32:54,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-05 11:32:54,660 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 308 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:54,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 356 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:32:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21642 states. [2025-02-05 11:32:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21642 to 15544. [2025-02-05 11:32:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15544 states, 15543 states have (on average 1.0881425722190052) internal successors, (16913), 15543 states have internal predecessors, (16913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15544 states to 15544 states and 16913 transitions. [2025-02-05 11:32:54,835 INFO L78 Accepts]: Start accepts. Automaton has 15544 states and 16913 transitions. Word has length 496 [2025-02-05 11:32:54,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:54,836 INFO L471 AbstractCegarLoop]: Abstraction has 15544 states and 16913 transitions. [2025-02-05 11:32:54,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:54,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15544 states and 16913 transitions. [2025-02-05 11:32:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-02-05 11:32:54,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:54,848 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:54,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 11:32:54,849 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash 124943511, now seen corresponding path program 1 times [2025-02-05 11:32:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96767157] [2025-02-05 11:32:54,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:54,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-02-05 11:32:54,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-02-05 11:32:54,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:54,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 11:32:55,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:55,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96767157] [2025-02-05 11:32:55,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96767157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:55,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:55,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:55,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863235534] [2025-02-05 11:32:55,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:55,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:55,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:55,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:55,403 INFO L87 Difference]: Start difference. First operand 15544 states and 16913 transitions. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:56,377 INFO L93 Difference]: Finished difference Result 34960 states and 38072 transitions. [2025-02-05 11:32:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:56,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 517 [2025-02-05 11:32:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:56,399 INFO L225 Difference]: With dead ends: 34960 [2025-02-05 11:32:56,399 INFO L226 Difference]: Without dead ends: 19601 [2025-02-05 11:32:56,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-05 11:32:56,410 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 123 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:56,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 99 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:32:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19601 states. [2025-02-05 11:32:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 18126. [2025-02-05 11:32:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18126 states, 18125 states have (on average 1.088055172413793) internal successors, (19721), 18125 states have internal predecessors, (19721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18126 states to 18126 states and 19721 transitions. [2025-02-05 11:32:56,681 INFO L78 Accepts]: Start accepts. Automaton has 18126 states and 19721 transitions. Word has length 517 [2025-02-05 11:32:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:56,681 INFO L471 AbstractCegarLoop]: Abstraction has 18126 states and 19721 transitions. [2025-02-05 11:32:56,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18126 states and 19721 transitions. [2025-02-05 11:32:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-02-05 11:32:56,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:56,690 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:32:56,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 11:32:56,691 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:56,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash 444883810, now seen corresponding path program 1 times [2025-02-05 11:32:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392629434] [2025-02-05 11:32:56,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:56,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-02-05 11:32:56,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-02-05 11:32:56,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:56,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-02-05 11:32:56,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:56,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392629434] [2025-02-05 11:32:56,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392629434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:56,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:56,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016235760] [2025-02-05 11:32:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:56,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:56,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:56,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:56,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:56,884 INFO L87 Difference]: Start difference. First operand 18126 states and 19721 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:57,428 INFO L93 Difference]: Finished difference Result 34956 states and 38010 transitions. [2025-02-05 11:32:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:57,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 524 [2025-02-05 11:32:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:57,445 INFO L225 Difference]: With dead ends: 34956 [2025-02-05 11:32:57,445 INFO L226 Difference]: Without dead ends: 17200 [2025-02-05 11:32:57,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:57,457 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 192 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:57,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 329 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:32:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17200 states. [2025-02-05 11:32:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17200 to 17016. [2025-02-05 11:32:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17016 states, 17015 states have (on average 1.0719952982662357) internal successors, (18240), 17015 states have internal predecessors, (18240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17016 states to 17016 states and 18240 transitions. [2025-02-05 11:32:57,624 INFO L78 Accepts]: Start accepts. Automaton has 17016 states and 18240 transitions. Word has length 524 [2025-02-05 11:32:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:57,625 INFO L471 AbstractCegarLoop]: Abstraction has 17016 states and 18240 transitions. [2025-02-05 11:32:57,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17016 states and 18240 transitions. [2025-02-05 11:32:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-02-05 11:32:57,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:57,638 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:57,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 11:32:57,638 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:57,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash 867886885, now seen corresponding path program 1 times [2025-02-05 11:32:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:57,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817719138] [2025-02-05 11:32:57,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:57,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:57,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-02-05 11:32:57,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-02-05 11:32:57,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:57,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-02-05 11:32:58,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:58,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817719138] [2025-02-05 11:32:58,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817719138] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:32:58,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394786809] [2025-02-05 11:32:58,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:58,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:32:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:32:58,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:32:58,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:32:58,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-02-05 11:32:58,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-02-05 11:32:58,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:58,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:58,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 11:32:58,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:32:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-02-05 11:32:59,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:33:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-02-05 11:33:07,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394786809] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:33:07,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:33:07,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 11 [2025-02-05 11:33:07,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154574986] [2025-02-05 11:33:07,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:33:07,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 11:33:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:07,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 11:33:07,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-02-05 11:33:07,203 INFO L87 Difference]: Start difference. First operand 17016 states and 18240 transitions. Second operand has 12 states, 12 states have (on average 96.58333333333333) internal successors, (1159), 11 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:11,077 INFO L93 Difference]: Finished difference Result 56909 states and 61332 transitions. [2025-02-05 11:33:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 11:33:11,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 96.58333333333333) internal successors, (1159), 11 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 555 [2025-02-05 11:33:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:11,118 INFO L225 Difference]: With dead ends: 56909 [2025-02-05 11:33:11,118 INFO L226 Difference]: Without dead ends: 39895 [2025-02-05 11:33:11,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 1102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-02-05 11:33:11,134 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 2214 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 3824 mSolverCounterSat, 1087 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2214 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 4911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1087 IncrementalHoareTripleChecker+Valid, 3824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:11,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2214 Valid, 216 Invalid, 4911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1087 Valid, 3824 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:33:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39895 states. [2025-02-05 11:33:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39895 to 22918. [2025-02-05 11:33:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22918 states, 22917 states have (on average 1.0770606972989485) internal successors, (24683), 22917 states have internal predecessors, (24683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22918 states to 22918 states and 24683 transitions. [2025-02-05 11:33:11,422 INFO L78 Accepts]: Start accepts. Automaton has 22918 states and 24683 transitions. Word has length 555 [2025-02-05 11:33:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:11,423 INFO L471 AbstractCegarLoop]: Abstraction has 22918 states and 24683 transitions. [2025-02-05 11:33:11,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 96.58333333333333) internal successors, (1159), 11 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 22918 states and 24683 transitions. [2025-02-05 11:33:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-02-05 11:33:11,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:11,433 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:11,441 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-05 11:33:11,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:11,634 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:11,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1822938625, now seen corresponding path program 1 times [2025-02-05 11:33:11,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:11,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406704034] [2025-02-05 11:33:11,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:11,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:11,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 638 statements into 1 equivalence classes. [2025-02-05 11:33:11,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 638 of 638 statements. [2025-02-05 11:33:11,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:11,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 11:33:11,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406704034] [2025-02-05 11:33:11,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406704034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:11,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:11,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:11,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341841097] [2025-02-05 11:33:11,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:11,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:11,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:11,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:11,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:11,874 INFO L87 Difference]: Start difference. First operand 22918 states and 24683 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:12,446 INFO L93 Difference]: Finished difference Result 47303 states and 50916 transitions. [2025-02-05 11:33:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:12,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 638 [2025-02-05 11:33:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:12,485 INFO L225 Difference]: With dead ends: 47303 [2025-02-05 11:33:12,486 INFO L226 Difference]: Without dead ends: 24387 [2025-02-05 11:33:12,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:12,507 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 40 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:12,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:33:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24387 states. [2025-02-05 11:33:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24387 to 22174. [2025-02-05 11:33:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22174 states, 22173 states have (on average 1.0762639245929735) internal successors, (23864), 22173 states have internal predecessors, (23864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22174 states to 22174 states and 23864 transitions. [2025-02-05 11:33:12,856 INFO L78 Accepts]: Start accepts. Automaton has 22174 states and 23864 transitions. Word has length 638 [2025-02-05 11:33:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:12,856 INFO L471 AbstractCegarLoop]: Abstraction has 22174 states and 23864 transitions. [2025-02-05 11:33:12,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 22174 states and 23864 transitions. [2025-02-05 11:33:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2025-02-05 11:33:12,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:12,876 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:12,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 11:33:12,876 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:12,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1690642035, now seen corresponding path program 1 times [2025-02-05 11:33:12,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:12,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142013894] [2025-02-05 11:33:12,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:12,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-02-05 11:33:12,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-02-05 11:33:12,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:12,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2307 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2025-02-05 11:33:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:13,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142013894] [2025-02-05 11:33:13,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142013894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:13,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:13,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235322772] [2025-02-05 11:33:13,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:13,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:13,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:13,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:13,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:13,349 INFO L87 Difference]: Start difference. First operand 22174 states and 23864 transitions. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:13,946 INFO L93 Difference]: Finished difference Result 38997 states and 41922 transitions. [2025-02-05 11:33:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:13,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 857 [2025-02-05 11:33:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:13,972 INFO L225 Difference]: With dead ends: 38997 [2025-02-05 11:33:13,972 INFO L226 Difference]: Without dead ends: 17192 [2025-02-05 11:33:13,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:13,988 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 74 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:13,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 305 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:33:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17192 states. [2025-02-05 11:33:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17192 to 16451. [2025-02-05 11:33:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16451 states, 16450 states have (on average 1.066322188449848) internal successors, (17541), 16450 states have internal predecessors, (17541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16451 states to 16451 states and 17541 transitions. [2025-02-05 11:33:14,329 INFO L78 Accepts]: Start accepts. Automaton has 16451 states and 17541 transitions. Word has length 857 [2025-02-05 11:33:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:14,329 INFO L471 AbstractCegarLoop]: Abstraction has 16451 states and 17541 transitions. [2025-02-05 11:33:14,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 16451 states and 17541 transitions. [2025-02-05 11:33:14,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2025-02-05 11:33:14,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:14,346 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:33:14,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 11:33:14,347 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:14,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1942669288, now seen corresponding path program 1 times [2025-02-05 11:33:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:14,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303247078] [2025-02-05 11:33:14,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:14,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 882 statements into 1 equivalence classes. [2025-02-05 11:33:14,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 882 of 882 statements. [2025-02-05 11:33:14,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:14,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2253 backedges. 1516 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2025-02-05 11:33:14,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303247078] [2025-02-05 11:33:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303247078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012744069] [2025-02-05 11:33:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:14,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:14,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:14,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:14,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:14,792 INFO L87 Difference]: Start difference. First operand 16451 states and 17541 transitions. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:15,422 INFO L93 Difference]: Finished difference Result 33469 states and 35684 transitions. [2025-02-05 11:33:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 882 [2025-02-05 11:33:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:15,442 INFO L225 Difference]: With dead ends: 33469 [2025-02-05 11:33:15,443 INFO L226 Difference]: Without dead ends: 17388 [2025-02-05 11:33:15,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:15,452 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 100 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:15,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 113 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:33:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17388 states. [2025-02-05 11:33:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17388 to 15526. [2025-02-05 11:33:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15526 states, 15525 states have (on average 1.066731078904992) internal successors, (16561), 15525 states have internal predecessors, (16561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15526 states to 15526 states and 16561 transitions. [2025-02-05 11:33:15,667 INFO L78 Accepts]: Start accepts. Automaton has 15526 states and 16561 transitions. Word has length 882 [2025-02-05 11:33:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:15,668 INFO L471 AbstractCegarLoop]: Abstraction has 15526 states and 16561 transitions. [2025-02-05 11:33:15,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 15526 states and 16561 transitions. [2025-02-05 11:33:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2025-02-05 11:33:15,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:15,685 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:33:15,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 11:33:15,685 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:15,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash -595190667, now seen corresponding path program 1 times [2025-02-05 11:33:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:15,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406519360] [2025-02-05 11:33:15,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:15,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 883 statements into 1 equivalence classes. [2025-02-05 11:33:15,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 883 of 883 statements. [2025-02-05 11:33:15,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:15,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 1533 proven. 539 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-05 11:33:17,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:17,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406519360] [2025-02-05 11:33:17,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406519360] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:33:17,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720532310] [2025-02-05 11:33:17,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:17,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:17,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:33:17,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:33:17,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:33:17,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 883 statements into 1 equivalence classes. [2025-02-05 11:33:17,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 883 of 883 statements. [2025-02-05 11:33:17,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:17,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:17,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:33:17,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:33:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 1056 proven. 0 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2025-02-05 11:33:17,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:33:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720532310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:17,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:33:17,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-02-05 11:33:17,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853112906] [2025-02-05 11:33:17,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:17,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:33:17,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:17,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:33:17,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-05 11:33:17,782 INFO L87 Difference]: Start difference. First operand 15526 states and 16561 transitions. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:18,658 INFO L93 Difference]: Finished difference Result 33636 states and 36003 transitions. [2025-02-05 11:33:18,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:33:18,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 883 [2025-02-05 11:33:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:18,676 INFO L225 Difference]: With dead ends: 33636 [2025-02-05 11:33:18,676 INFO L226 Difference]: Without dead ends: 18480 [2025-02-05 11:33:18,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 883 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-05 11:33:18,689 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 233 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:18,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 84 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:33:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18480 states. [2025-02-05 11:33:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18480 to 16817. [2025-02-05 11:33:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16817 states, 16816 states have (on average 1.0638082778306375) internal successors, (17889), 16816 states have internal predecessors, (17889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16817 states to 16817 states and 17889 transitions. [2025-02-05 11:33:18,848 INFO L78 Accepts]: Start accepts. Automaton has 16817 states and 17889 transitions. Word has length 883 [2025-02-05 11:33:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:18,848 INFO L471 AbstractCegarLoop]: Abstraction has 16817 states and 17889 transitions. [2025-02-05 11:33:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 16817 states and 17889 transitions. [2025-02-05 11:33:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2025-02-05 11:33:18,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:18,906 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:33:18,915 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-05 11:33:19,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:19,107 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:19,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:19,107 INFO L85 PathProgramCache]: Analyzing trace with hash -167064213, now seen corresponding path program 1 times [2025-02-05 11:33:19,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:19,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176331086] [2025-02-05 11:33:19,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:19,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:19,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 960 statements into 1 equivalence classes. [2025-02-05 11:33:19,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 960 of 960 statements. [2025-02-05 11:33:19,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:19,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2837 backedges. 1959 proven. 536 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-02-05 11:33:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176331086] [2025-02-05 11:33:21,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176331086] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:33:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382508701] [2025-02-05 11:33:21,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:21,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:21,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:33:21,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:33:21,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 11:33:21,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 960 statements into 1 equivalence classes. [2025-02-05 11:33:21,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 960 of 960 statements. [2025-02-05 11:33:21,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:21,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:21,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:33:21,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:33:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2837 backedges. 1924 proven. 0 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2025-02-05 11:33:21,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:33:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382508701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:21,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:33:21,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-02-05 11:33:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557578309] [2025-02-05 11:33:21,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:21,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:21,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:21,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:21,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:33:21,547 INFO L87 Difference]: Start difference. First operand 16817 states and 17889 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:22,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:22,123 INFO L93 Difference]: Finished difference Result 37689 states and 40138 transitions. [2025-02-05 11:33:22,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:22,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 960 [2025-02-05 11:33:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:22,146 INFO L225 Difference]: With dead ends: 37689 [2025-02-05 11:33:22,146 INFO L226 Difference]: Without dead ends: 21242 [2025-02-05 11:33:22,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 969 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:33:22,159 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 70 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:22,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 301 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:33:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21242 states. [2025-02-05 11:33:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21242 to 17009. [2025-02-05 11:33:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17009 states, 17008 states have (on average 1.0621472248353716) internal successors, (18065), 17008 states have internal predecessors, (18065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17009 states to 17009 states and 18065 transitions. [2025-02-05 11:33:22,335 INFO L78 Accepts]: Start accepts. Automaton has 17009 states and 18065 transitions. Word has length 960 [2025-02-05 11:33:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:22,336 INFO L471 AbstractCegarLoop]: Abstraction has 17009 states and 18065 transitions. [2025-02-05 11:33:22,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 17009 states and 18065 transitions. [2025-02-05 11:33:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2025-02-05 11:33:22,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:22,351 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:33:22,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:33:22,552 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,SelfDestructingSolverStorable27 [2025-02-05 11:33:22,552 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:22,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:22,553 INFO L85 PathProgramCache]: Analyzing trace with hash 29801323, now seen corresponding path program 1 times [2025-02-05 11:33:22,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:22,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702498950] [2025-02-05 11:33:22,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:22,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 966 statements into 1 equivalence classes. [2025-02-05 11:33:22,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 966 of 966 statements. [2025-02-05 11:33:22,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:22,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 1707 proven. 232 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2025-02-05 11:33:23,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702498950] [2025-02-05 11:33:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702498950] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:33:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168061584] [2025-02-05 11:33:23,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:23,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:23,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:33:23,975 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:33:23,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 11:33:24,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 966 statements into 1 equivalence classes. [2025-02-05 11:33:24,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 966 of 966 statements. [2025-02-05 11:33:24,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:24,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:24,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:33:24,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:33:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 1627 proven. 434 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-02-05 11:33:24,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:33:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2609 backedges. 2061 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-02-05 11:33:25,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168061584] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:33:25,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:33:25,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 13 [2025-02-05 11:33:25,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631678940] [2025-02-05 11:33:25,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:25,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:33:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:25,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:33:25,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-05 11:33:25,322 INFO L87 Difference]: Start difference. First operand 17009 states and 18065 transitions. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:26,323 INFO L93 Difference]: Finished difference Result 40096 states and 42643 transitions. [2025-02-05 11:33:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:33:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 966 [2025-02-05 11:33:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:26,342 INFO L225 Difference]: With dead ends: 40096 [2025-02-05 11:33:26,343 INFO L226 Difference]: Without dead ends: 23273 [2025-02-05 11:33:26,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1938 GetRequests, 1926 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-05 11:33:26,351 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 161 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:26,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 71 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:33:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23273 states. [2025-02-05 11:33:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23273 to 21063. [2025-02-05 11:33:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21063 states, 21062 states have (on average 1.0649036178900388) internal successors, (22429), 21062 states have internal predecessors, (22429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21063 states to 21063 states and 22429 transitions. [2025-02-05 11:33:26,561 INFO L78 Accepts]: Start accepts. Automaton has 21063 states and 22429 transitions. Word has length 966 [2025-02-05 11:33:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:26,562 INFO L471 AbstractCegarLoop]: Abstraction has 21063 states and 22429 transitions. [2025-02-05 11:33:26,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 21063 states and 22429 transitions. [2025-02-05 11:33:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2025-02-05 11:33:26,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:26,579 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:33:26,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 11:33:26,779 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,SelfDestructingSolverStorable28 [2025-02-05 11:33:26,780 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:26,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1205937186, now seen corresponding path program 1 times [2025-02-05 11:33:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061443293] [2025-02-05 11:33:26,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:26,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:26,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1078 statements into 1 equivalence classes. [2025-02-05 11:33:26,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1078 of 1078 statements. [2025-02-05 11:33:26,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:26,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3450 backedges. 2224 proven. 783 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2025-02-05 11:33:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061443293] [2025-02-05 11:33:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061443293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:33:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315864391] [2025-02-05 11:33:28,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:33:28,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:33:28,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 11:33:28,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1078 statements into 1 equivalence classes.