./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.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 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:15:48,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:15:48,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:15:48,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:15:48,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:15:48,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:15:48,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:15:48,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:15:48,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:15:48,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:15:48,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:15:48,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:15:48,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:15:48,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:15:48,458 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:15:48,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:15:48,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:15:48,458 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:15:48,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:15:48,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:15:48,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:15:48,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:15:48,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:15:48,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:15:48,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:15:48,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:15:48,460 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 -> 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d [2025-02-05 16:15:48,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:15:48,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:15:48,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:15:48,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:15:48,664 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:15:48,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2025-02-05 16:15:49,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c6d55980/cf29c2224d07408bb2239c48405e55af/FLAG30c429c0c [2025-02-05 16:15:50,075 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:15:50,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2025-02-05 16:15:50,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c6d55980/cf29c2224d07408bb2239c48405e55af/FLAG30c429c0c [2025-02-05 16:15:50,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c6d55980/cf29c2224d07408bb2239c48405e55af [2025-02-05 16:15:50,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:15:50,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:15:50,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:15:50,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:15:50,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:15:50,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40acd5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50, skipping insertion in model container [2025-02-05 16:15:50,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:15:50,603 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/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2025-02-05 16:15:50,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:15:50,618 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:15:50,657 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/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2025-02-05 16:15:50,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:15:50,672 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:15:50,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50 WrapperNode [2025-02-05 16:15:50,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:15:50,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:15:50,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:15:50,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:15:50,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,705 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 276 [2025-02-05 16:15:50,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:15:50,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:15:50,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:15:50,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:15:50,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,733 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 16:15:50,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:15:50,746 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:15:50,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:15:50,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:15:50,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (1/1) ... [2025-02-05 16:15:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:15:50,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:50,769 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 16:15:50,771 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 16:15:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:15:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:15:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:15:50,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:15:50,846 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:15:50,848 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:15:51,094 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-05 16:15:51,094 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:15:51,101 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:15:51,102 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:15:51,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:15:51 BoogieIcfgContainer [2025-02-05 16:15:51,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:15:51,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:15:51,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:15:51,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:15:51,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:15:50" (1/3) ... [2025-02-05 16:15:51,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cbf67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:15:51, skipping insertion in model container [2025-02-05 16:15:51,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:50" (2/3) ... [2025-02-05 16:15:51,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cbf67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:15:51, skipping insertion in model container [2025-02-05 16:15:51,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:15:51" (3/3) ... [2025-02-05 16:15:51,111 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2025-02-05 16:15:51,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:15:51,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:15:51,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:15:51,175 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;@2e09f438, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:15:51,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:15:51,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 69 states have internal predecessors, (117), 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 16:15:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 16:15:51,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:51,185 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] [2025-02-05 16:15:51,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:51,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2142403755, now seen corresponding path program 1 times [2025-02-05 16:15:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:51,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142153147] [2025-02-05 16:15:51,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:51,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:51,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 16:15:51,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 16:15:51,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:51,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:51,335 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 16:15:51,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142153147] [2025-02-05 16:15:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142153147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:51,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:51,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:15:51,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604340769] [2025-02-05 16:15:51,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:51,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:15:51,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:51,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:15:51,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:15:51,352 INFO L87 Difference]: Start difference. First operand has 70 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 69 states have internal predecessors, (117), 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 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 16:15:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:51,362 INFO L93 Difference]: Finished difference Result 109 states and 180 transitions. [2025-02-05 16:15:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:15:51,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 21 [2025-02-05 16:15:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:51,368 INFO L225 Difference]: With dead ends: 109 [2025-02-05 16:15:51,368 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 16:15:51,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:15:51,371 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:51,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 16:15:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-05 16:15:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.696969696969697) internal successors, (112), 66 states have internal predecessors, (112), 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 16:15:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 112 transitions. [2025-02-05 16:15:51,392 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 112 transitions. Word has length 21 [2025-02-05 16:15:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:51,393 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 112 transitions. [2025-02-05 16:15:51,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 16:15:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 112 transitions. [2025-02-05 16:15:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 16:15:51,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:51,393 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] [2025-02-05 16:15:51,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:15:51,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:51,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1631869578, now seen corresponding path program 1 times [2025-02-05 16:15:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:51,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157977848] [2025-02-05 16:15:51,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:51,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 16:15:51,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 16:15:51,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:51,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:51,592 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 16:15:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:51,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157977848] [2025-02-05 16:15:51,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157977848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:51,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:51,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156634120] [2025-02-05 16:15:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:51,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:51,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:51,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:51,594 INFO L87 Difference]: Start difference. First operand 67 states and 112 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 16:15:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:51,647 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2025-02-05 16:15:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:15:51,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2025-02-05 16:15:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:51,651 INFO L225 Difference]: With dead ends: 109 [2025-02-05 16:15:51,651 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 16:15:51,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:51,652 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:51,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 16:15:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-05 16:15:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 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 16:15:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2025-02-05 16:15:51,659 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 21 [2025-02-05 16:15:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:51,659 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2025-02-05 16:15:51,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 16:15:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2025-02-05 16:15:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 16:15:51,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:51,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:51,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:15:51,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:51,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash 859137748, now seen corresponding path program 1 times [2025-02-05 16:15:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:51,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951730797] [2025-02-05 16:15:51,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:51,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 16:15:51,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 16:15:51,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:51,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:51,876 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 16:15:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:51,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951730797] [2025-02-05 16:15:51,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951730797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:51,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:51,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:51,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123355937] [2025-02-05 16:15:51,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:51,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:51,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:51,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:51,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:51,877 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 16:15:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:52,002 INFO L93 Difference]: Finished difference Result 371 states and 569 transitions. [2025-02-05 16:15:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:15:52,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2025-02-05 16:15:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:52,004 INFO L225 Difference]: With dead ends: 371 [2025-02-05 16:15:52,004 INFO L226 Difference]: Without dead ends: 333 [2025-02-05 16:15:52,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:15:52,005 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 529 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:52,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 696 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-05 16:15:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 103. [2025-02-05 16:15:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 102 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 16:15:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2025-02-05 16:15:52,022 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 43 [2025-02-05 16:15:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:52,022 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2025-02-05 16:15:52,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 16:15:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2025-02-05 16:15:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 16:15:52,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:52,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:52,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:15:52,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:52,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:52,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2118008207, now seen corresponding path program 1 times [2025-02-05 16:15:52,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:52,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207341250] [2025-02-05 16:15:52,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:52,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 16:15:52,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 16:15:52,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:52,163 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 16:15:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207341250] [2025-02-05 16:15:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207341250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:52,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:52,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:52,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418790914] [2025-02-05 16:15:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:52,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:52,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:52,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:52,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:52,164 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 16:15:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:52,224 INFO L93 Difference]: Finished difference Result 240 states and 361 transitions. [2025-02-05 16:15:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2025-02-05 16:15:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:52,226 INFO L225 Difference]: With dead ends: 240 [2025-02-05 16:15:52,226 INFO L226 Difference]: Without dead ends: 166 [2025-02-05 16:15:52,226 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 16:15:52,226 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:52,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-05 16:15:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2025-02-05 16:15:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4658385093167703) internal successors, (236), 161 states have internal predecessors, (236), 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 16:15:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 236 transitions. [2025-02-05 16:15:52,242 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 236 transitions. Word has length 45 [2025-02-05 16:15:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:52,243 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 236 transitions. [2025-02-05 16:15:52,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 16:15:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2025-02-05 16:15:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 16:15:52,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:52,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:52,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:15:52,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:52,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2144635854, now seen corresponding path program 1 times [2025-02-05 16:15:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:52,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809715957] [2025-02-05 16:15:52,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:52,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 16:15:52,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 16:15:52,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:52,469 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 16:15:52,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:52,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809715957] [2025-02-05 16:15:52,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809715957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:52,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:52,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:52,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955944818] [2025-02-05 16:15:52,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:52,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:52,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:52,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:52,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:52,471 INFO L87 Difference]: Start difference. First operand 162 states and 236 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 16:15:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:52,581 INFO L93 Difference]: Finished difference Result 297 states and 444 transitions. [2025-02-05 16:15:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:52,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 45 [2025-02-05 16:15:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:52,583 INFO L225 Difference]: With dead ends: 297 [2025-02-05 16:15:52,583 INFO L226 Difference]: Without dead ends: 164 [2025-02-05 16:15:52,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:52,584 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 96 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:52,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 255 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-05 16:15:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-02-05 16:15:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.453416149068323) internal successors, (234), 161 states have internal predecessors, (234), 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 16:15:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2025-02-05 16:15:52,595 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 45 [2025-02-05 16:15:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:52,595 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2025-02-05 16:15:52,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 16:15:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2025-02-05 16:15:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 16:15:52,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:52,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:52,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:15:52,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:52,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:52,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2028664301, now seen corresponding path program 1 times [2025-02-05 16:15:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968210586] [2025-02-05 16:15:52,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:52,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 16:15:52,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 16:15:52,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:52,783 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 16:15:52,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:52,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968210586] [2025-02-05 16:15:52,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968210586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:52,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:52,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:15:52,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835022540] [2025-02-05 16:15:52,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:52,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:15:52,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:52,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:15:52,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:52,784 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 16:15:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:52,815 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2025-02-05 16:15:52,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:15:52,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 46 [2025-02-05 16:15:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:52,816 INFO L225 Difference]: With dead ends: 170 [2025-02-05 16:15:52,816 INFO L226 Difference]: Without dead ends: 168 [2025-02-05 16:15:52,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:52,817 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:52,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-05 16:15:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-02-05 16:15:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.4311377245508983) internal successors, (239), 167 states have internal predecessors, (239), 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 16:15:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 239 transitions. [2025-02-05 16:15:52,821 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 239 transitions. Word has length 46 [2025-02-05 16:15:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:52,822 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 239 transitions. [2025-02-05 16:15:52,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 16:15:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 239 transitions. [2025-02-05 16:15:52,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 16:15:52,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:52,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:52,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:15:52,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:52,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash -505514128, now seen corresponding path program 1 times [2025-02-05 16:15:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:52,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87041024] [2025-02-05 16:15:52,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:52,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 16:15:52,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 16:15:52,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:52,897 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 16:15:52,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:52,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87041024] [2025-02-05 16:15:52,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87041024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:52,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:52,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:52,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220260283] [2025-02-05 16:15:52,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:52,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:52,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:52,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:52,900 INFO L87 Difference]: Start difference. First operand 168 states and 239 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 16:15:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:52,915 INFO L93 Difference]: Finished difference Result 430 states and 631 transitions. [2025-02-05 16:15:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:52,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2025-02-05 16:15:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:52,917 INFO L225 Difference]: With dead ends: 430 [2025-02-05 16:15:52,918 INFO L226 Difference]: Without dead ends: 291 [2025-02-05 16:15:52,918 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 16:15:52,918 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:52,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-05 16:15:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-02-05 16:15:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.4444444444444444) internal successors, (416), 288 states have internal predecessors, (416), 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 16:15:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 416 transitions. [2025-02-05 16:15:52,934 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 416 transitions. Word has length 47 [2025-02-05 16:15:52,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:52,935 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 416 transitions. [2025-02-05 16:15:52,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 16:15:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 416 transitions. [2025-02-05 16:15:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 16:15:52,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:52,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:52,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:15:52,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:52,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash -90338256, now seen corresponding path program 1 times [2025-02-05 16:15:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:52,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362092838] [2025-02-05 16:15:52,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:52,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 16:15:52,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 16:15:52,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:52,987 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 16:15:52,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:52,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362092838] [2025-02-05 16:15:52,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362092838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:52,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:52,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:52,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457558062] [2025-02-05 16:15:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:52,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:52,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:52,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:52,989 INFO L87 Difference]: Start difference. First operand 289 states and 416 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 16:15:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:53,007 INFO L93 Difference]: Finished difference Result 777 states and 1134 transitions. [2025-02-05 16:15:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:53,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2025-02-05 16:15:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:53,010 INFO L225 Difference]: With dead ends: 777 [2025-02-05 16:15:53,010 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 16:15:53,010 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 16:15:53,011 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 46 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:53,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 16:15:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 515. [2025-02-05 16:15:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.4357976653696498) internal successors, (738), 514 states have internal predecessors, (738), 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 16:15:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 738 transitions. [2025-02-05 16:15:53,033 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 738 transitions. Word has length 47 [2025-02-05 16:15:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,034 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 738 transitions. [2025-02-05 16:15:53,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 16:15:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 738 transitions. [2025-02-05 16:15:53,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 16:15:53,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:53,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:15:53,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:53,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash -577056528, now seen corresponding path program 1 times [2025-02-05 16:15:53,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:53,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433011336] [2025-02-05 16:15:53,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:53,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 16:15:53,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 16:15:53,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:53,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:53,094 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 16:15:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433011336] [2025-02-05 16:15:53,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433011336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:53,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:53,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:53,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392405541] [2025-02-05 16:15:53,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:53,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:53,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:53,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:53,096 INFO L87 Difference]: Start difference. First operand 515 states and 738 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 16:15:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:53,118 INFO L93 Difference]: Finished difference Result 1423 states and 2044 transitions. [2025-02-05 16:15:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:53,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2025-02-05 16:15:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:53,121 INFO L225 Difference]: With dead ends: 1423 [2025-02-05 16:15:53,121 INFO L226 Difference]: Without dead ends: 937 [2025-02-05 16:15:53,122 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 16:15:53,122 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:53,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:53,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-05 16:15:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 935. [2025-02-05 16:15:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.411134903640257) internal successors, (1318), 934 states have internal predecessors, (1318), 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 16:15:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1318 transitions. [2025-02-05 16:15:53,148 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1318 transitions. Word has length 47 [2025-02-05 16:15:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,148 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1318 transitions. [2025-02-05 16:15:53,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 16:15:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1318 transitions. [2025-02-05 16:15:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 16:15:53,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:53,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:15:53,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:53,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:53,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1134540880, now seen corresponding path program 1 times [2025-02-05 16:15:53,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:53,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708606278] [2025-02-05 16:15:53,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:53,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:53,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 16:15:53,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 16:15:53,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:53,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:53,194 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 16:15:53,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:53,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708606278] [2025-02-05 16:15:53,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708606278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:53,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:53,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:53,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252209450] [2025-02-05 16:15:53,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:53,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:53,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:53,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:53,196 INFO L87 Difference]: Start difference. First operand 935 states and 1318 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 16:15:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:53,230 INFO L93 Difference]: Finished difference Result 1902 states and 2716 transitions. [2025-02-05 16:15:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:53,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2025-02-05 16:15:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:53,235 INFO L225 Difference]: With dead ends: 1902 [2025-02-05 16:15:53,235 INFO L226 Difference]: Without dead ends: 1371 [2025-02-05 16:15:53,236 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 16:15:53,237 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 47 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:53,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-02-05 16:15:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2025-02-05 16:15:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.4035087719298245) internal successors, (1920), 1368 states have internal predecessors, (1920), 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 16:15:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1920 transitions. [2025-02-05 16:15:53,284 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1920 transitions. Word has length 49 [2025-02-05 16:15:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,284 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1920 transitions. [2025-02-05 16:15:53,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 16:15:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1920 transitions. [2025-02-05 16:15:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:15:53,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,286 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:15:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:15:53,286 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:53,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash -18445534, now seen corresponding path program 1 times [2025-02-05 16:15:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:53,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518995512] [2025-02-05 16:15:53,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:53,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:53,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:15:53,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:15:53,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:53,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:15:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518995512] [2025-02-05 16:15:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518995512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:53,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802838740] [2025-02-05 16:15:53,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:53,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:53,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:53,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:53,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:53,417 INFO L87 Difference]: Start difference. First operand 1369 states and 1920 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 16:15:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:53,588 INFO L93 Difference]: Finished difference Result 7019 states and 9877 transitions. [2025-02-05 16:15:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:53,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 64 [2025-02-05 16:15:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:53,608 INFO L225 Difference]: With dead ends: 7019 [2025-02-05 16:15:53,609 INFO L226 Difference]: Without dead ends: 5681 [2025-02-05 16:15:53,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:15:53,613 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 351 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:53,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 471 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2025-02-05 16:15:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 2705. [2025-02-05 16:15:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2704 states have (on average 1.3994082840236686) internal successors, (3784), 2704 states have internal predecessors, (3784), 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 16:15:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3784 transitions. [2025-02-05 16:15:53,700 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3784 transitions. Word has length 64 [2025-02-05 16:15:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,700 INFO L471 AbstractCegarLoop]: Abstraction has 2705 states and 3784 transitions. [2025-02-05 16:15:53,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 16:15:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3784 transitions. [2025-02-05 16:15:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:15:53,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,701 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:15:53,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:15:53,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:53,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:53,703 INFO L85 PathProgramCache]: Analyzing trace with hash 396730338, now seen corresponding path program 1 times [2025-02-05 16:15:53,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:53,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245589005] [2025-02-05 16:15:53,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:53,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:53,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:15:53,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:15:53,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:53,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:15:53,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245589005] [2025-02-05 16:15:53,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245589005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:53,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:53,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:53,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416461767] [2025-02-05 16:15:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:53,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:53,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:53,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:53,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:53,803 INFO L87 Difference]: Start difference. First operand 2705 states and 3784 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 16:15:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:54,145 INFO L93 Difference]: Finished difference Result 8355 states and 11741 transitions. [2025-02-05 16:15:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:54,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 64 [2025-02-05 16:15:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:54,165 INFO L225 Difference]: With dead ends: 8355 [2025-02-05 16:15:54,165 INFO L226 Difference]: Without dead ends: 7017 [2025-02-05 16:15:54,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:15:54,169 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 373 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:54,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 438 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2025-02-05 16:15:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 4713. [2025-02-05 16:15:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4713 states, 4712 states have (on average 1.3921901528013583) internal successors, (6560), 4712 states have internal predecessors, (6560), 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 16:15:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4713 states to 4713 states and 6560 transitions. [2025-02-05 16:15:54,308 INFO L78 Accepts]: Start accepts. Automaton has 4713 states and 6560 transitions. Word has length 64 [2025-02-05 16:15:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:54,309 INFO L471 AbstractCegarLoop]: Abstraction has 4713 states and 6560 transitions. [2025-02-05 16:15:54,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 16:15:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4713 states and 6560 transitions. [2025-02-05 16:15:54,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:15:54,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:54,313 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:15:54,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:15:54,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:54,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash -89987934, now seen corresponding path program 1 times [2025-02-05 16:15:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:54,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483637544] [2025-02-05 16:15:54,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:54,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:15:54,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:15:54,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:15:54,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483637544] [2025-02-05 16:15:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483637544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:54,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:54,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277743731] [2025-02-05 16:15:54,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:54,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:54,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:54,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:54,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:54,404 INFO L87 Difference]: Start difference. First operand 4713 states and 6560 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 16:15:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:54,602 INFO L93 Difference]: Finished difference Result 9691 states and 13605 transitions. [2025-02-05 16:15:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:54,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 64 [2025-02-05 16:15:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:54,625 INFO L225 Difference]: With dead ends: 9691 [2025-02-05 16:15:54,626 INFO L226 Difference]: Without dead ends: 8353 [2025-02-05 16:15:54,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:15:54,629 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 360 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:54,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 446 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8353 states. [2025-02-05 16:15:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8353 to 6049. [2025-02-05 16:15:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6049 states, 6048 states have (on average 1.3928571428571428) internal successors, (8424), 6048 states have internal predecessors, (8424), 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 16:15:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6049 states to 6049 states and 8424 transitions. [2025-02-05 16:15:54,769 INFO L78 Accepts]: Start accepts. Automaton has 6049 states and 8424 transitions. Word has length 64 [2025-02-05 16:15:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:54,769 INFO L471 AbstractCegarLoop]: Abstraction has 6049 states and 8424 transitions. [2025-02-05 16:15:54,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 16:15:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6049 states and 8424 transitions. [2025-02-05 16:15:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:15:54,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:54,770 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:54,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:15:54,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:54,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash 606387456, now seen corresponding path program 1 times [2025-02-05 16:15:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:54,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840975899] [2025-02-05 16:15:54,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:54,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:15:54,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:15:54,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:54,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:54,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840975899] [2025-02-05 16:15:54,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840975899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:54,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:54,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:54,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768358551] [2025-02-05 16:15:54,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:54,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:54,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:54,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:54,854 INFO L87 Difference]: Start difference. First operand 6049 states and 8424 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 16:15:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:54,937 INFO L93 Difference]: Finished difference Result 10391 states and 14565 transitions. [2025-02-05 16:15:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2025-02-05 16:15:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:54,951 INFO L225 Difference]: With dead ends: 10391 [2025-02-05 16:15:54,951 INFO L226 Difference]: Without dead ends: 4373 [2025-02-05 16:15:54,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:54,958 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:54,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 195 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2025-02-05 16:15:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4371. [2025-02-05 16:15:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4371 states, 4370 states have (on average 1.3954233409610983) internal successors, (6098), 4370 states have internal predecessors, (6098), 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 16:15:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4371 states to 4371 states and 6098 transitions. [2025-02-05 16:15:55,079 INFO L78 Accepts]: Start accepts. Automaton has 4371 states and 6098 transitions. Word has length 66 [2025-02-05 16:15:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:55,080 INFO L471 AbstractCegarLoop]: Abstraction has 4371 states and 6098 transitions. [2025-02-05 16:15:55,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 16:15:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4371 states and 6098 transitions. [2025-02-05 16:15:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:15:55,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:55,081 INFO L218 NwaCegarLoop]: trace histogram [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 16:15:55,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:15:55,081 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:55,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1213057310, now seen corresponding path program 1 times [2025-02-05 16:15:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623791492] [2025-02-05 16:15:55,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:55,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:15:55,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:15:55,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:55,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:15:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:55,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623791492] [2025-02-05 16:15:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623791492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:55,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:55,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616488810] [2025-02-05 16:15:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:55,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:55,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:55,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:55,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:55,192 INFO L87 Difference]: Start difference. First operand 4371 states and 6098 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 16:15:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:55,337 INFO L93 Difference]: Finished difference Result 8221 states and 11543 transitions. [2025-02-05 16:15:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:55,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 66 [2025-02-05 16:15:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:55,350 INFO L225 Difference]: With dead ends: 8221 [2025-02-05 16:15:55,351 INFO L226 Difference]: Without dead ends: 7259 [2025-02-05 16:15:55,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:15:55,354 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 350 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:55,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 515 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7259 states. [2025-02-05 16:15:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7259 to 5331. [2025-02-05 16:15:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5330 states have (on average 1.3962476547842402) internal successors, (7442), 5330 states have internal predecessors, (7442), 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 16:15:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 7442 transitions. [2025-02-05 16:15:55,479 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 7442 transitions. Word has length 66 [2025-02-05 16:15:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:55,479 INFO L471 AbstractCegarLoop]: Abstraction has 5331 states and 7442 transitions. [2025-02-05 16:15:55,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 16:15:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 7442 transitions. [2025-02-05 16:15:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:15:55,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:55,480 INFO L218 NwaCegarLoop]: trace histogram [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 16:15:55,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:15:55,480 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:55,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash -785675157, now seen corresponding path program 1 times [2025-02-05 16:15:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:55,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096728495] [2025-02-05 16:15:55,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:55,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:15:55,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:15:55,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:55,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:55,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096728495] [2025-02-05 16:15:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096728495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:55,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:55,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856064399] [2025-02-05 16:15:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:55,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:55,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:55,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:55,536 INFO L87 Difference]: Start difference. First operand 5331 states and 7442 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 16:15:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:55,579 INFO L93 Difference]: Finished difference Result 7975 states and 11140 transitions. [2025-02-05 16:15:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:55,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-02-05 16:15:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:55,584 INFO L225 Difference]: With dead ends: 7975 [2025-02-05 16:15:55,584 INFO L226 Difference]: Without dead ends: 2693 [2025-02-05 16:15:55,588 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 16:15:55,588 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:55,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2025-02-05 16:15:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2691. [2025-02-05 16:15:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2690 states have (on average 1.3762081784386617) internal successors, (3702), 2690 states have internal predecessors, (3702), 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 16:15:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3702 transitions. [2025-02-05 16:15:55,634 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3702 transitions. Word has length 67 [2025-02-05 16:15:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:55,634 INFO L471 AbstractCegarLoop]: Abstraction has 2691 states and 3702 transitions. [2025-02-05 16:15:55,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 16:15:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3702 transitions. [2025-02-05 16:15:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:15:55,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:55,635 INFO L218 NwaCegarLoop]: trace histogram [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 16:15:55,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:15:55,635 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:55,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash -580110382, now seen corresponding path program 1 times [2025-02-05 16:15:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:55,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732097617] [2025-02-05 16:15:55,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:55,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:15:55,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:15:55,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:55,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732097617] [2025-02-05 16:15:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732097617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:55,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:55,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412995454] [2025-02-05 16:15:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:55,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:55,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:55,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:55,689 INFO L87 Difference]: Start difference. First operand 2691 states and 3702 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 16:15:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:55,712 INFO L93 Difference]: Finished difference Result 4015 states and 5530 transitions. [2025-02-05 16:15:55,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:55,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2025-02-05 16:15:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:55,715 INFO L225 Difference]: With dead ends: 4015 [2025-02-05 16:15:55,715 INFO L226 Difference]: Without dead ends: 1373 [2025-02-05 16:15:55,717 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 16:15:55,717 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:55,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 165 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-02-05 16:15:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1371. [2025-02-05 16:15:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1370 states have (on average 1.3532846715328468) internal successors, (1854), 1370 states have internal predecessors, (1854), 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 16:15:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1854 transitions. [2025-02-05 16:15:55,757 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1854 transitions. Word has length 69 [2025-02-05 16:15:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:55,758 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1854 transitions. [2025-02-05 16:15:55,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 16:15:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1854 transitions. [2025-02-05 16:15:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:15:55,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:55,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:55,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:15:55,759 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:55,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1582877785, now seen corresponding path program 1 times [2025-02-05 16:15:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:55,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027948551] [2025-02-05 16:15:55,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:55,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:15:55,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:15:55,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:55,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:55,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027948551] [2025-02-05 16:15:55,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027948551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:55,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:55,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:55,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939366405] [2025-02-05 16:15:55,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:55,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:55,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:55,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:55,813 INFO L87 Difference]: Start difference. First operand 1371 states and 1854 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 16:15:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:55,827 INFO L93 Difference]: Finished difference Result 2035 states and 2758 transitions. [2025-02-05 16:15:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:55,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2025-02-05 16:15:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:55,829 INFO L225 Difference]: With dead ends: 2035 [2025-02-05 16:15:55,829 INFO L226 Difference]: Without dead ends: 713 [2025-02-05 16:15:55,830 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 16:15:55,830 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:55,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:55,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-02-05 16:15:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 711. [2025-02-05 16:15:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.3253521126760563) internal successors, (941), 710 states have internal predecessors, (941), 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 16:15:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 941 transitions. [2025-02-05 16:15:55,843 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 941 transitions. Word has length 71 [2025-02-05 16:15:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:55,843 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 941 transitions. [2025-02-05 16:15:55,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 16:15:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 941 transitions. [2025-02-05 16:15:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:15:55,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:55,844 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:15:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:15:55,844 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:55,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1148697088, now seen corresponding path program 1 times [2025-02-05 16:15:55,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:55,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675962774] [2025-02-05 16:15:55,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:55,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:55,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:15:55,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:15:55,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:55,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:56,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:56,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675962774] [2025-02-05 16:15:56,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675962774] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:15:56,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035483399] [2025-02-05 16:15:56,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:56,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:56,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:56,075 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 16:15:56,078 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 16:15:56,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:15:56,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:15:56,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:56,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:56,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:15:56,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:15:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:15:56,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:15:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:15:56,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035483399] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:15:56,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:15:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2025-02-05 16:15:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15670507] [2025-02-05 16:15:56,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:15:56,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 16:15:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:56,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 16:15:56,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:15:56,516 INFO L87 Difference]: Start difference. First operand 711 states and 941 transitions. Second operand has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 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 16:15:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:57,563 INFO L93 Difference]: Finished difference Result 4832 states and 6413 transitions. [2025-02-05 16:15:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 16:15:57,563 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 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 73 [2025-02-05 16:15:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:57,571 INFO L225 Difference]: With dead ends: 4832 [2025-02-05 16:15:57,571 INFO L226 Difference]: Without dead ends: 4170 [2025-02-05 16:15:57,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=459, Invalid=1703, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 16:15:57,575 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1450 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:57,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 636 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:15:57,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2025-02-05 16:15:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4126. [2025-02-05 16:15:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4126 states, 4125 states have (on average 1.2608484848484849) internal successors, (5201), 4125 states have internal predecessors, (5201), 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 16:15:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 5201 transitions. [2025-02-05 16:15:57,661 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 5201 transitions. Word has length 73 [2025-02-05 16:15:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:57,661 INFO L471 AbstractCegarLoop]: Abstraction has 4126 states and 5201 transitions. [2025-02-05 16:15:57,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 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 16:15:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 5201 transitions. [2025-02-05 16:15:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:15:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:57,662 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:15:57,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:15:57,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:57,867 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:57,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash -934163952, now seen corresponding path program 1 times [2025-02-05 16:15:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:57,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208067652] [2025-02-05 16:15:57,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:57,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:57,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:15:57,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:15:57,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:57,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:58,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208067652] [2025-02-05 16:15:58,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208067652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:15:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060623164] [2025-02-05 16:15:58,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:58,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:58,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:58,215 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 16:15:58,216 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 16:15:58,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:15:58,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:15:58,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:58,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:58,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 16:15:58,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:15:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:58,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:15:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:59,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060623164] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:15:59,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:15:59,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-05 16:15:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61054134] [2025-02-05 16:15:59,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:15:59,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 16:15:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:59,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 16:15:59,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:15:59,424 INFO L87 Difference]: Start difference. First operand 4126 states and 5201 transitions. Second operand has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 20 states have internal predecessors, (169), 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 16:15:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:59,840 INFO L93 Difference]: Finished difference Result 11729 states and 14859 transitions. [2025-02-05 16:15:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:15:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 20 states have internal predecessors, (169), 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 74 [2025-02-05 16:15:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:59,850 INFO L225 Difference]: With dead ends: 11729 [2025-02-05 16:15:59,850 INFO L226 Difference]: Without dead ends: 8361 [2025-02-05 16:15:59,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:15:59,853 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 538 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:59,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 480 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:15:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8361 states. [2025-02-05 16:15:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8361 to 8233. [2025-02-05 16:15:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8233 states, 8232 states have (on average 1.2444120505344995) internal successors, (10244), 8232 states have internal predecessors, (10244), 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 16:15:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8233 states to 8233 states and 10244 transitions. [2025-02-05 16:15:59,990 INFO L78 Accepts]: Start accepts. Automaton has 8233 states and 10244 transitions. Word has length 74 [2025-02-05 16:15:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:59,990 INFO L471 AbstractCegarLoop]: Abstraction has 8233 states and 10244 transitions. [2025-02-05 16:15:59,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 20 states have internal predecessors, (169), 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 16:15:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 8233 states and 10244 transitions. [2025-02-05 16:15:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:15:59,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:59,991 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:15:59,998 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 16:16:00,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:00,196 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:00,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1925238352, now seen corresponding path program 1 times [2025-02-05 16:16:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688877574] [2025-02-05 16:16:00,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:00,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:16:00,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:16:00,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:00,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:00,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:00,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688877574] [2025-02-05 16:16:00,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688877574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:00,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603264808] [2025-02-05 16:16:00,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:00,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:00,411 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 16:16:00,412 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 16:16:00,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:16:00,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:16:00,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:00,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:00,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:16:00,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:00,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603264808] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:01,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-05 16:16:01,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538475625] [2025-02-05 16:16:01,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:01,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:16:01,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:01,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:16:01,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:16:01,315 INFO L87 Difference]: Start difference. First operand 8233 states and 10244 transitions. Second operand has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 25 states have internal predecessors, (196), 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 16:16:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:02,684 INFO L93 Difference]: Finished difference Result 29807 states and 37396 transitions. [2025-02-05 16:16:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 16:16:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 25 states have internal predecessors, (196), 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 74 [2025-02-05 16:16:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:02,714 INFO L225 Difference]: With dead ends: 29807 [2025-02-05 16:16:02,714 INFO L226 Difference]: Without dead ends: 21894 [2025-02-05 16:16:02,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=656, Invalid=2536, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 16:16:02,722 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1155 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:02,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1172 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:16:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21894 states. [2025-02-05 16:16:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21894 to 21574. [2025-02-05 16:16:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21574 states, 21573 states have (on average 1.2251425392852175) internal successors, (26430), 21573 states have internal predecessors, (26430), 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 16:16:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21574 states to 21574 states and 26430 transitions. [2025-02-05 16:16:03,196 INFO L78 Accepts]: Start accepts. Automaton has 21574 states and 26430 transitions. Word has length 74 [2025-02-05 16:16:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:03,198 INFO L471 AbstractCegarLoop]: Abstraction has 21574 states and 26430 transitions. [2025-02-05 16:16:03,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 25 states have internal predecessors, (196), 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 16:16:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 21574 states and 26430 transitions. [2025-02-05 16:16:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:16:03,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:03,199 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:16:03,206 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 16:16:03,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:03,400 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:03,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash 322985588, now seen corresponding path program 1 times [2025-02-05 16:16:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:03,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085951892] [2025-02-05 16:16:03,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:03,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:16:03,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:16:03,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:03,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:04,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:04,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085951892] [2025-02-05 16:16:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085951892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:04,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998957145] [2025-02-05 16:16:04,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:04,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:04,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:04,825 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 16:16:04,827 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 16:16:04,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:16:04,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:16:04,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:04,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:04,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 16:16:04,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:06,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998957145] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:08,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 15] total 55 [2025-02-05 16:16:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025180252] [2025-02-05 16:16:08,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:08,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-05 16:16:08,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:08,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-05 16:16:08,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2751, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 16:16:08,158 INFO L87 Difference]: Start difference. First operand 21574 states and 26430 transitions. Second operand has 55 states, 55 states have (on average 3.690909090909091) internal successors, (203), 55 states have internal predecessors, (203), 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 16:16:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:22,186 INFO L93 Difference]: Finished difference Result 71439 states and 88350 transitions. [2025-02-05 16:16:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-02-05 16:16:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.690909090909091) internal successors, (203), 55 states have internal predecessors, (203), 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 76 [2025-02-05 16:16:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:22,381 INFO L225 Difference]: With dead ends: 71439 [2025-02-05 16:16:22,381 INFO L226 Difference]: Without dead ends: 63116 [2025-02-05 16:16:22,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9760 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=5940, Invalid=24860, Unknown=0, NotChecked=0, Total=30800 [2025-02-05 16:16:22,425 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 6022 mSDsluCounter, 5349 mSDsCounter, 0 mSdLazyCounter, 5233 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6022 SdHoareTripleChecker+Valid, 5556 SdHoareTripleChecker+Invalid, 5369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 5233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:22,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6022 Valid, 5556 Invalid, 5369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 5233 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 16:16:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63116 states. [2025-02-05 16:16:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63116 to 22125. [2025-02-05 16:16:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22125 states, 22124 states have (on average 1.2220665340806365) internal successors, (27037), 22124 states have internal predecessors, (27037), 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 16:16:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22125 states to 22125 states and 27037 transitions. [2025-02-05 16:16:23,255 INFO L78 Accepts]: Start accepts. Automaton has 22125 states and 27037 transitions. Word has length 76 [2025-02-05 16:16:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:23,256 INFO L471 AbstractCegarLoop]: Abstraction has 22125 states and 27037 transitions. [2025-02-05 16:16:23,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.690909090909091) internal successors, (203), 55 states have internal predecessors, (203), 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 16:16:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 22125 states and 27037 transitions. [2025-02-05 16:16:23,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:16:23,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:23,257 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:16:23,267 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 16:16:23,458 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,SelfDestructingSolverStorable21 [2025-02-05 16:16:23,458 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:23,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1533885237, now seen corresponding path program 1 times [2025-02-05 16:16:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:23,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840578432] [2025-02-05 16:16:23,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:23,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:16:23,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:16:23,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:23,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:24,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840578432] [2025-02-05 16:16:24,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840578432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10252689] [2025-02-05 16:16:24,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:24,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:24,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:24,288 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 16:16:24,290 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 16:16:24,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:16:24,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:16:24,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:24,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:24,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 16:16:24,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:25,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:26,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10252689] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:26,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:26,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 47 [2025-02-05 16:16:26,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403010792] [2025-02-05 16:16:26,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:26,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-05 16:16:26,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:26,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-05 16:16:26,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1980, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 16:16:26,822 INFO L87 Difference]: Start difference. First operand 22125 states and 27037 transitions. Second operand has 47 states, 47 states have (on average 4.425531914893617) internal successors, (208), 47 states have internal predecessors, (208), 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 16:16:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:56,491 INFO L93 Difference]: Finished difference Result 69740 states and 87115 transitions. [2025-02-05 16:16:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2025-02-05 16:16:56,492 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.425531914893617) internal successors, (208), 47 states have internal predecessors, (208), 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 76 [2025-02-05 16:16:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:56,551 INFO L225 Difference]: With dead ends: 69740 [2025-02-05 16:16:56,552 INFO L226 Difference]: Without dead ends: 59886 [2025-02-05 16:16:56,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22535 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=10324, Invalid=47998, Unknown=0, NotChecked=0, Total=58322 [2025-02-05 16:16:56,568 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 9329 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9329 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 4120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:56,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9329 Valid, 3466 Invalid, 4120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 3940 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 16:16:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59886 states. [2025-02-05 16:16:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59886 to 23671. [2025-02-05 16:16:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23671 states, 23670 states have (on average 1.2292353189691592) internal successors, (29096), 23670 states have internal predecessors, (29096), 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 16:16:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23671 states to 23671 states and 29096 transitions. [2025-02-05 16:16:57,493 INFO L78 Accepts]: Start accepts. Automaton has 23671 states and 29096 transitions. Word has length 76 [2025-02-05 16:16:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:57,493 INFO L471 AbstractCegarLoop]: Abstraction has 23671 states and 29096 transitions. [2025-02-05 16:16:57,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.425531914893617) internal successors, (208), 47 states have internal predecessors, (208), 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 16:16:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 23671 states and 29096 transitions. [2025-02-05 16:16:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:16:57,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:57,495 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:16:57,501 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 16:16:57,699 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,SelfDestructingSolverStorable22 [2025-02-05 16:16:57,699 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:57,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1187387686, now seen corresponding path program 1 times [2025-02-05 16:16:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123737173] [2025-02-05 16:16:57,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:57,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:16:57,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:16:57,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:57,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:58,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:58,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123737173] [2025-02-05 16:16:58,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123737173] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:58,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214116664] [2025-02-05 16:16:58,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:58,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:58,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:58,353 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 16:16:58,356 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 16:16:58,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:16:58,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:16:58,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:58,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:58,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-05 16:16:58,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:17:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:01,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:17:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214116664] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:17:04,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:17:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 22] total 59 [2025-02-05 16:17:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768332739] [2025-02-05 16:17:04,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:17:04,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-02-05 16:17:04,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:04,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-02-05 16:17:04,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=2901, Unknown=0, NotChecked=0, Total=3422 [2025-02-05 16:17:04,609 INFO L87 Difference]: Start difference. First operand 23671 states and 29096 transitions. Second operand has 59 states, 59 states have (on average 3.5762711864406778) internal successors, (211), 59 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 16:17:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:21,483 INFO L93 Difference]: Finished difference Result 37689 states and 46175 transitions. [2025-02-05 16:17:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-02-05 16:17:21,484 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 3.5762711864406778) internal successors, (211), 59 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 77 [2025-02-05 16:17:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:21,507 INFO L225 Difference]: With dead ends: 37689 [2025-02-05 16:17:21,507 INFO L226 Difference]: Without dead ends: 25686 [2025-02-05 16:17:21,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5889 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=3834, Invalid=14256, Unknown=0, NotChecked=0, Total=18090 [2025-02-05 16:17:21,516 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1723 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:21,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 1973 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2861 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 16:17:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25686 states. [2025-02-05 16:17:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25686 to 19952. [2025-02-05 16:17:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19952 states, 19951 states have (on average 1.2230965866372614) internal successors, (24402), 19951 states have internal predecessors, (24402), 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 16:17:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19952 states to 19952 states and 24402 transitions. [2025-02-05 16:17:22,299 INFO L78 Accepts]: Start accepts. Automaton has 19952 states and 24402 transitions. Word has length 77 [2025-02-05 16:17:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:22,300 INFO L471 AbstractCegarLoop]: Abstraction has 19952 states and 24402 transitions. [2025-02-05 16:17:22,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 3.5762711864406778) internal successors, (211), 59 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 16:17:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 19952 states and 24402 transitions. [2025-02-05 16:17:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:17:22,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:22,301 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:22,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:17:22,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-05 16:17:22,505 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:22,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1627548773, now seen corresponding path program 1 times [2025-02-05 16:17:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:22,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584836203] [2025-02-05 16:17:22,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:22,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:22,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:17:22,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:17:22,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:22,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584836203] [2025-02-05 16:17:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584836203] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:17:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281047052] [2025-02-05 16:17:22,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:22,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:17:22,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:17:22,960 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:17:22,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:17:23,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:17:23,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:17:23,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:23,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:23,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:17:23,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:17:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:23,593 INFO L312 TraceCheckSpWp]: Computing backward predicates...